A complete grammar for decomposing a family of graphs into 3-connected components

zbMath1178.05054arXiv0808.1138MaRDI QIDQ1010886

Bilyana Shoilekova, Éric Fusy, Guillaume Chapuy, Mihyun Kang

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic enumerationgraph decompositiongrammar3-connected componentsbijective construction of planar graphsdissymmetry theoremfamily of graphsseries counting labellled planar graphssubfamily of graphssymbolic combinatoricsunlabelled planar graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16) Connectivity (05C40)

Related Items (15)

Generating functions of bipartite maps on orientable surfaces ⋮ Characterisation of symmetries of unlabelled triangulations ⋮ The maximum degree of random planar graphs ⋮ Random graphs from a weighted minor-closed class ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Symmetries of unlabelled planar triangulations ⋮ Asymptotic enumeration and limit laws for graphs of fixed genus ⋮ Local convergence of random planar graphs ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ Random cubic planar graphs revisited ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Limit laws of planar maps with prescribed vertex degrees ⋮ Graph classes with given 3-connected components: Asymptotic enumeration and random graphs ⋮ Enumeration of chordal planar graphs and maps ⋮ Spanning trees in random series-parallel graphs

This page was built for publication: A complete grammar for decomposing a family of graphs into 3-connected components