## An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps (2011)

Citations: | 22 - 4 self |

### BibTeX

@MISC{Bonichon11aninformation-theoretic,

author = {Nicolas Bonichon and Cyril Gavoille and Nicolas Hanusse},

title = { An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps},

year = {2011}

}

### OpenURL

### Abstract

This chapter deals with compressed coding of graphs. We focus on planar graphs, a widely studied class of graphs. A planar graph is a graph that admits an embedding in the plane without edge crossings. Planar maps (class of embeddings of a planar graph) are easier to study than planar graphs, but as a planar graph may admit an exponential number of maps, they give little information on graphs. In order to give an information-theoretic upper bound on planar graphs, we introduce a definition of a quasi-canonical embedding for planar graphs: well-orderly maps. This appears to be an useful tool to study and encode planar graphs. We present upper bounds on the number of unlabeled planar graphs and on the number of edges in a random planar graph. We also present an algorithm to compute well-orderly maps and implying an efficient coding of planar graphs.