Planar graphs, via well-orderly maps and trees
type: Item
instance of: scholarly article
title: Planar graphs, via well-orderly maps and trees
zbMATH Open document ID: 1099.05024
author: Nicolas Bonichon
author: Cyril Gavoille
author: Nicolas Hanusse
author: Dominique Poulalhon
author: Gilles Schaeffer
published in: Graphs and Combinatorics
publication date: 2006-09-12T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5052829
zbMATH Keywords: Triangulation
zbMATH Keywords: Realizer
describes a project that uses: Edgebreaker
MaRDI profile type: MaRDI publication profile
full work available at URL: s00373-006-0647-2
OpenAlex ID: W1971404176
Wikidata QID: Q54272913
cites work: Q4418676
cites work: Q4449244
cites work: The number of labeled 2-connected planar graphs
cites work: Q4414483
cites work: Q4737230
cites work: Orderly spanning trees with applications to graph encoding and graph drawing
cites work: Q4386297
cites work: Efficient Message Routing in Planar Networks
cites work: On the Number of Edges in Random Planar Graphs
cites work: Asymptotic enumeration and limit laws of planar graphs
cites work: Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
cites work: Short encodings of planar graphs and maps
cites work: Q4808622
cites work: Q3791172
cites work: Random planar graphs
cites work: On random planar graphs, the number of planar graphs and their triangulations
cites work: Q4449243
cites work: Q3138887
cites work: Compact oracles for reachability and approximate distances in planar digraphs
cites work: On the succinct representation of graphs
cites work: A Census of Planar Triangulations
cites work: Graphs on unlabelled nodes with a given number of edges
cites work: Embedding planar graphs in four pages
cites work: Compact visibility representation and straight-line grid embedding of plane graphs.
DBLP publication ID: journals/gc/BonichonGHPS06
DOI: 10.1007/S00373-006-0647-2
Recommended article: Graph-Theoretic Concepts in Computer Science
Recommended article: An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
Recommended article: Short encodings of planar graphs and maps
Recommended article: A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
Recommended article: Q4418676
description: scientific article; zbMATH DE number 5052829