Plane Cubic Graphs with Prescribed Face Areas

DOI10.1017/S0963548300000407zbMath0794.05024MaRDI QIDQ4291195

Carsten Thomassen

Publication date: 28 August 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

areadrawingplane triangulationbounded faceconjecture of Ringelplane, cubic graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (8)

Drawing Planar Graphs with Prescribed Face Areas ⋮ Linear-time algorithms for hole-free rectilinear proportional contact graph representations ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality ⋮ On the area-universality of triangulations ⋮ Octagonal drawings of plane graphs with prescribed face areas ⋮ On rectilinear duals for vertex-weighted plane graphs ⋮ On Area-Universal Quadrangulations

Cites Work

• Planarity and duality of finite and infinite graphs
• Convex Representations of Graphs
• Convex Maps
• On Diagrams Representing Maps

This page was built for publication: Plane Cubic Graphs with Prescribed Face Areas