TY - CHAP
T1 - The Circle Packing Theorem
AU - Nachmias, Asaf
N1 - Publisher Copyright:
© 2020, The Author(s).
PY - 2020
Y1 - 2020
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85073146128&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-27968-4_3
DO - 10.1007/978-3-030-27968-4_3
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???
AN - SCOPUS:85073146128
T3 - Lecture Notes in Mathematics
SP - 33
EP - 46
BT - Lecture Notes in Mathematics
PB - Springer Verlag
ER -