The Circle Packing Theorem

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

A graph G = (V, E) is planar if it can be properly drawn in the plane, that is, if there exists a mapping sending the vertices to distinct points of ℝ2 and edges to continuous curves between the corresponding vertices so that no two curves intersect, except at the vertices they share. We call such a mapping a proper drawing of G.

Original languageEnglish
Title of host publicationLecture Notes in Mathematics
PublisherSpringer Verlag
Pages33-46
Number of pages14
DOIs
StatePublished - 2020

Publication series

NameLecture Notes in Mathematics
Volume2243
ISSN (Print)0075-8434
ISSN (Electronic)1617-9692

Fingerprint

Dive into the research topics of 'The Circle Packing Theorem'. Together they form a unique fingerprint.

Cite this