Planar graphs, via well-orderly maps and trees

DOI10.1007/s00373-006-0647-2zbMath1099.05024OpenAlexW1971404176WikidataQ54272913 ScholiaQ54272913MaRDI QIDQ2502033

Cyril Gavoille, Nicolas Hanusse, Nicolas Bonichon, Gilles Schaeffer, Dominique Poulalhon

Publication date: 12 September 2006

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0647-2

zbMATH Keywords

TriangulationRealizer

Mathematics Subject Classification ID

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

Related Items (18)

Classes of graphs embeddable in order-dependent surfaces ⋮ Schnyder woods for higher genus triangulated surfaces, with applications to encoding ⋮ The space complexity of sum labelling ⋮ Lower bounds for protrusion replacement by counting equivalence classes ⋮ On fully diverse sets of geometric objects and graphs ⋮ Statistics of Feynman amplitudes in \(\phi^4\)-theory ⋮ Schnyder decompositions for regular plane graphs and application to drawing ⋮ Pachinko ⋮ Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds ⋮ Random graphs on surfaces ⋮ Topological classification of polynomial complex differential equations with all the critical points of centre type ⋮ Degree distribution in random planar graphs ⋮ The space complexity of sum labelling ⋮ Uniform random sampling of planar graphs in linear time ⋮ Asymptotic enumeration and limit laws of planar graphs ⋮ Fast and compact planar embeddings ⋮ The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex ⋮ A Census of Plane Graphs with Polyline Edges

Uses Software

• Edgebreaker

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the succinct representation of graphs
• Embedding planar graphs in four pages
• On random planar graphs, the number of planar graphs and their triangulations
• Random planar graphs
• Short encodings of planar graphs and maps
• The number of labeled 2-connected planar graphs
• Graphs on unlabelled nodes with a given number of edges
• Asymptotic enumeration and limit laws of planar graphs
• A Census of Planar Triangulations
• Efficient Message Routing in Planar Networks
• Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
• On the Number of Edges in Random Planar Graphs
• Compact oracles for reachability and approximate distances in planar digraphs
• Algorithms and Data Structures

This page was built for publication: Planar graphs, via well-orderly maps and trees