Enumeration of chordal planar graphs and maps

DOI10.1016/j.disc.2022.113163zbMath1502.05094arXiv2202.13340OpenAlexW4296903803MaRDI QIDQ2092390

Marc Noy, Clément Requilé, Jordi Castellví

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.13340

zbMATH Keywords

asymptotic enumerationchordal planar graphssubcritical graph class

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling limits of random graphs from subcritical classes
• Counting outerplanar maps
• A complete grammar for decomposing a family of graphs into 3-connected components
• Counting labelled chordal graphs
• The number of labeled dissections of a k-ball
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• Asymptotic enumeration and limit laws of planar graphs
• Asymptotic Study of Subcritical Graph Classes
• Random Trees
• Subgraph statistics in subcritical graph classes
• A Census of Planar Maps