Sciweavers

Share
WG
2004
Springer

Planar Graphs, via Well-Orderly Maps and Trees

10 years 5 months ago
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)
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,
Added 03 Jul 2010
Updated 03 Jul 2010
Type Conference
Year 2004
Where WG
Authors Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer
Comments (0)
books