The uniquely embeddable planar graphs

DOI10.1016/0012-365X(73)90169-6zbMath0253.05110OpenAlexW2020496428MaRDI QIDQ2557706

Herbert Fleischner

Publication date: 1973

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(73)90169-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (6)

Pairs of trees in tree--tree triangulations ⋮ The volume conjecture for polyhedra implies the Stoker conjecture ⋮ 2‐complexes with unique embeddings in 3‐space ⋮ The maximum volume of hyperbolic polyhedra ⋮ On well-covered triangulations. II. ⋮ The importance of being Euler

Cites Work

• Parallel concepts in graph theory
• Über endliche, ebene Eulersche und paare, kubische Graphen
• On the Maximum Order of the Automorphism Group of a Planar Triply Connected Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: The uniquely embeddable planar graphs