{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:57:12Z","timestamp":1770739032388,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s00373-006-0647-2","type":"journal-article","created":{"date-parts":[[2006,7,5]],"date-time":"2006-07-05T04:06:47Z","timestamp":1152072407000},"page":"185-202","source":"Crossref","is-referenced-by-count":38,"title":["Planar Graphs, via Well-Orderly Maps and Trees"],"prefix":"10.1007","volume":"22","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Hanusse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Poulalhon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"647_CR1","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N.: An information upper bound of planar graphs using triangulation. Research Report RR-1279-02, LaBRI, University of Bordeaux, 351, cours de la Lib\u00e9ration, 33405 Talence Cedex, France, September 2002"},{"key":"647_CR2","doi-asserted-by":"crossref","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. In: 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 499\u2013510. Springer, February 2003","DOI":"10.1007\/3-540-36494-3_44"},{"key":"647_CR3","unstructured":"Bodirsky, M., Gr\u00f6pl, C., Kang, M.: Generating labeled planar graphs uniformly at random. In: 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of LNCS, pages 1095\u20131107, 2003"},{"key":"647_CR4","doi-asserted-by":"crossref","unstructured":"Bender, E.A., Gao, Z., Wormald, N.C.: The number of labeled 2-connected planar graphs. The Electronic Journal of Combinatorics 9(1), R43 (2002)","DOI":"10.37236\/1659"},{"key":"647_CR5","unstructured":"Bonichon, N., Le Sa\u00ebc, B., Mosbah, M.: Optimal area algorithm for planar polyline drawings. In: 28th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), volume 2573 of LNCS, pages 35\u201346. Springer, 2002"},{"key":"647_CR6","unstructured":"Bonichon, N., Le Sa\u00ebc, B., Mosbah, M.: Wagner's theorem on realizers. In: 29th International Colloquium on Automata, Languages and Programming (ICALP). volume 2380 of LNCS, pages 1043\u20131053. Springer, 2002"},{"key":"647_CR7","unstructured":"Bonichon, N.: A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. In: Formal Power Series & Algebraic Combinatorics (FPSAC). July 2002"},{"key":"647_CR8","doi-asserted-by":"crossref","unstructured":"Chih-Nan Chuang, R., Garg, A., He X., Kao M.-Y., Lu H.-I.: Compact encodings of planar graphs via canonical orderings and multiple parentheses. In: 25th International Colloquium on Automata, Languages and Programming (ICALP), volume 1443 of LNCS, pages 118\u2013129. Springer, July 1998","DOI":"10.1007\/BFb0055046"},{"key":"647_CR9","unstructured":"Chiang, Y.-T., Lin, C.-C., Lu, H.-I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: 12th Symposium on Discrete Algorithms (SODA), pages 506\u2013515. ACM-SIAM, January 2001"},{"key":"647_CR10","unstructured":"Denise, A., Vasconcellos, M., Welsh, D. J. A.: The random planar graph. Congressus Numerantium 113, 61\u201379 (1996)"},{"key":"647_CR11","doi-asserted-by":"crossref","unstructured":"Frederickson, G. N., Janardan, R.: Efficient message routing in planar networks. SIAM Journal on Computing, 18(4), 843\u2013857, August (1989)","DOI":"10.1137\/0218058"},{"key":"647_CR12","unstructured":"Flajolet, P., Sedgewick,R.: Analytic combinatorics. Future book available online at the URL http:\/\/algo.inria.fr\/flajolet\/Publications\/books.html"},{"key":"647_CR13","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Hanusse, N.: Compact routing tables for graphs of bounded genus. In: 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of LNCS, pages 351\u2013360. Springer, July 1999","DOI":"10.1007\/3-540-48523-6_32"},{"key":"647_CR14","unstructured":"Goulden, I. P., Jackson, D. M.: Combinatorial Enumeration. John Wiley & Sons, 1983"},{"key":"647_CR15","unstructured":"Gerke, S., McDiarmid, C. J. H.: On the number of edges in random planar graphs. Combinatorics, Probability & Computing, 2002 (to appear)"},{"key":"647_CR16","unstructured":"Gim\u00e9nez, O., Noy, M.: Asymptotic enumeration and limit laws of planar graphs. preprint arXiv:Math.CO\/051269"},{"key":"647_CR17","doi-asserted-by":"crossref","unstructured":"Khodakovsky, A., Alliez, P., Desbrun, M. Schr\u00f6der, P.: Near-optimal connectivity encoding of 2-manifold polygon meshes. Graphical Models, 2002. To appear in a special issue","DOI":"10.1006\/gmod.2002.0575"},{"key":"647_CR18","unstructured":"King, D., Rossignac, J.: Guaranteed 3.67V bit encoding of planar triangle graphs. In: 11th Canadian Conference on Computational Geometry. pp 146\u2013149, August 1999"},{"key":"647_CR19","doi-asserted-by":"crossref","unstructured":"Keeler, K. Westbrook, J.: Short encodings of planar graphs and maps. Discrete Applied Mathematics 58, 239\u2013252 (1995)","DOI":"10.1016\/0166-218X(93)E0150-W"},{"key":"647_CR20","doi-asserted-by":"crossref","unstructured":"Lu, H.-I.: Improved compact routing tables for planar networks via orderly spanning trees. In: 8th Annual International Computing & Combinatorics Conference (COCOON), volume 2387 of LNCS, pages 57\u201366. Springer, August 2002","DOI":"10.1007\/3-540-45655-4_8"},{"key":"647_CR21","unstructured":"Liskovets, V. A., Walsh, T. R.: Ten steps to counting planar graphs. Congressus Numerantium 60, 269\u2013277 (1987)"},{"key":"647_CR22","doi-asserted-by":"crossref","unstructured":"Munro, J. I., Raman, V.: Succinct representation of balanced parentheses, static trees and planar graphs. In: 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 118\u2013126. IEEE Computer Society Press, October 1997","DOI":"10.1109\/SFCS.1997.646100"},{"key":"647_CR23","unstructured":"McDiarmid, C., Steger, A., Welsh, D. J. A.: Random planar graphs. J. Comb. Theory Ser. B 93(2), 187\u2013205 (2005)"},{"key":"647_CR24","doi-asserted-by":"crossref","unstructured":"Osthus, D., Pr\u00f6mel, H. J., Taraz, A.: On random planar graphs, the number of planar graphs and their triangulations. Journal of Combinatorial Theory, Series B 88, 119\u2013134 (2003)","DOI":"10.1016\/S0095-8956(02)00040-0"},{"key":"647_CR25","doi-asserted-by":"crossref","unstructured":"Poulalhon, D., Schaeffer, G.: Optimal coding and sampling of triangulations. In: 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of LNCS, pages 1080\u20131094. Springer, July 2003","DOI":"10.1007\/3-540-45061-0_83"},{"key":"647_CR26","doi-asserted-by":"crossref","unstructured":"Rossignac, J.: Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics 5(1), 47\u201361 (1999)","DOI":"10.1109\/2945.764870"},{"key":"647_CR27","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: 1st Symposium on Discrete Algorithms (SODA), pp 138\u2013148. ACM-SIAM, 1990"},{"key":"647_CR28","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. In 42th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, October 2001.","DOI":"10.1109\/SFCS.2001.959898"},{"key":"647_CR29","doi-asserted-by":"crossref","unstructured":"Tur\u00e1n, G.: Succinct representations of graphs. Discrete Applied Mathematics 8, 289\u2013294 (1984)","DOI":"10.1016\/0166-218X(84)90126-4"},{"key":"647_CR30","doi-asserted-by":"crossref","unstructured":"Tutte, W. T.: A census of planar triangulations. Canadian Journal of Mathematics 14, 21\u201338 (1962)","DOI":"10.4153\/CJM-1962-002-9"},{"key":"647_CR31","doi-asserted-by":"crossref","unstructured":"Wright, E. M.: Graphs on unlabelled nodes with a given number of edges. Acta Math. 126, 1\u20139 (1971)","DOI":"10.1007\/BF02392023"},{"key":"647_CR32","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. Journal of Computer and System Sciences 38, 36\u201367 (1989)","DOI":"10.1016\/0022-0000(89)90032-9"},{"key":"647_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, H., He, X.: Compact visibility representation and straight-line grid embedding of plane graphs. In: Workshop on Algorithms and Data Structures (WADS), volume 2748 of LNCS, pages 493\u2013504. Springer, July 2003","DOI":"10.1007\/978-3-540-45078-8_43"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0647-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0647-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0647-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T19:03:14Z","timestamp":1736449394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0647-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0647-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}