Publication:4418676
From MaRDI portal
zbMath1035.68514MaRDI QIDQ4418676
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070499.htm
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A Compact Encoding of Plane Triangulations with Efficient Query Supports, Generating unlabeled connected cubic planar graphs uniformly at random, A compact encoding of plane triangulations with efficient query supports, Encoding toroidal triangulations, A bijection for essentially 4-connected toroidal triangulations, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, Quick encoding of plane graphs in \(\log _{2}14\) bits per edge, Intervals in Catalan lattices and realizers of triangulations, Random planar graphs, Generating labeled planar graphs uniformly at random, Planar polyline drawings via graph transformations, Planar graphs, via well-orderly maps and trees
Uses Software