Planar Graphs, via Well-Orderly Maps and Trees

The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show that the number of well-orderly maps with n nodes is at most 2αn+O(log n)

• Type: Conference
• Year: 2004
• Where: WG
• Authors: Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
• Keywords: Computer Science, Connected Planar Graph, Planar Maps, Well-orderly Maps, WG 2004