Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The number of planar ...
Conference paper

The number of planar graphs and properties of random planar graphs

Omer Gimenez (1) (2) (3), Marc Noy (1) (2) (3)
(1) Universitat Politècnica de Catalunya [Barcelona]
(2) Universitat Politècnica de Catalunya = Université polytechnique de Catalogne [Barcelona]
(3) Universitat Politècnica de Catalunya = Université polytechnique de Catalogne = Polytechnic University of Catalunya [Barcelona]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Proceedings
DOI
10.46298/dmtcs.3354
License
https://about.hal.science/hal-authorisation-v1
Indicators
567
Views
599
Downloads

The number of planar graphs and properties of random planar graphs

Omer Gimenez (1) (2) (3), Marc Noy (1) (2) (3)
(1) Universitat Politècnica de Catalunya [Barcelona]
(2) Universitat Politècnica de Catalunya = Université polytechnique de Catalogne [Barcelona]
(3) Universitat Politècnica de Catalunya = Université polytechnique de Catalogne = Polytechnic University of Catalunya [Barcelona]
Abstract
We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]
  • analytic combinatorics
  • normal law
  • Planar graph
  • random graph
  • asymptotic enumeration
  • limit law
Cited by

Source: OpenCitations

  • Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs

    Thirty Essays on Geometric Graph Theory

    Authors : Radoslav Fulek ORCID, Noushin Saeedi, Deniz Sarıöz

    Journal reference : Volume , 2012, pp. 249-261

    DOI : 10.1007/978-1-4614-0110-0_13
  • Properties of Random Graphs via Boltzmann Samplers

    Discrete Mathematics & Theoretical Computer Science

    Authors : Konstantinos Panagiotou ORCID, Andreas Weißl

    Journal reference : Volume DMTCS Proceedings vol. AH,..., 2007, pp.

    DOI : 10.46298/dmtcs.3552
  • The Degree Sequence of Random Graphs from Subcritical Classes

    Combinatorics Probability Computing

    Authors : NICLA BERNASCONI, KONSTANTINOS PANAGIOTOU ORCID, ANGELIKA STEGER ORCID

    Journal reference : Volume 18, 2009, pp. 647-681

    DOI : 10.1017/s0963548309990368
  • Blocks in Constrained Random Graphs with Fixed Average Degree

    Discrete Mathematics & Theoretical Computer Science

    Authors : Konstantinos Panagiotou ORCID

    Journal reference : Volume DMTCS Proceedings vol. AK,..., 2009, pp.

    DOI : 10.46298/dmtcs.2710
  • Graph classes with given 3-connected components: asymptotic counting and critical phenomena

    Electronic Notes in Discrete Mathematics

    Authors : Omer Giménez, Marc Noy ORCID, Juan José Rué ORCID

    Journal reference : Volume 29, 2007, pp. 521-529

    DOI : 10.1016/j.endm.2007.07.080
  • On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs

    Lecture notes in computer science

    Authors : Nicla Bernasconi, Konstantinos Panagiotou ORCID, Angelika Steger ORCID

    Journal reference : Volume , 2008, pp. 303-316

    DOI : 10.1007/978-3-540-85363-3_25
  • Estimation of the size of drug-like chemical space based on GDB-17 data

    Journal of Computer-Aided Molecular Design

    Authors : P. G. Polishchuk ORCID, T. I. Madzhidov ORCID, A. Varnek ORCID

    Journal reference : Volume 27, 2013, pp. 675-679

    DOI : 10.1007/s10822-013-9672-4
  • The random planar graph process

    Random Structures and Algorithms

    Authors : Stefanie Gerke ORCID, Dirk Schlatter, Angelika Steger ORCID, Anusch Taraz ORCID

    Journal reference : Volume 32, 2007, pp. 236-261

    DOI : 10.1002/rsa.20186
  • Dynamics and combinatorics of 2 and 3 dimensional triangulations

    Archive ouverte UNIGE (University of Geneva)

    Authors : Younan

    Journal reference : Volume , 2014, pp.

    DOI : 10.13097/archive-ouverte/unige:43269
  • Cover Contact Graphs

    Lecture notes in computer science

    Authors : Nieves Atienza ORCID, Natalia de Castro ORCID, Carmen Cortés ORCID, M. Ángeles Garrido ORCID, Clara I. Grima ORCID, Gregorio Hernández ORCID, Alberto Márquez ORCID, Auxiliadora Moreno, Martin Nöllenburg ORCID, José Ramon Portillo ORCID, Pedro Reyes ORCID, Jesús Valenzuela ORCID, Maria Trinidad Villar ORCID, Alexander Wolff ORCID

    Journal reference : Volume , 2008, pp. 171-182

    DOI : 10.1007/978-3-540-77537-9_18
  • On degrees in random triangulations of point sets

    Proceedings of the twenty-sixth annual symposium on Computational geometry

    Authors : Micha Sharir ORCID, Adam Sheffer ORCID, Emo Welzl

    Journal reference : Volume , 2010, pp. 297-306

    DOI : 10.1145/1810959.1811009
Preview
Loading PDF preview...