A complete grammar for decomposing a family of graphs into 3-connected components
From MaRDI portal
Publication:1010886
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
asymptotic enumeration; graph decomposition; grammar; 3-connected components; bijective construction of planar graphs; dissymmetry theorem; family of graphs; series counting labellled planar graphs; subfamily of graphs; symbolic combinatorics; unlabelled planar graphs
05C30: Enumeration in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05A16: Asymptotic enumeration
05C40: Connectivity
Related Items
Limit laws of planar maps with prescribed vertex degrees, Exact-Size Sampling of Enriched Trees in Linear Time, Spanning trees in random series-parallel graphs, Generating functions of bipartite maps on orientable surfaces, Characterisation of symmetries of unlabelled triangulations, Random graphs from a weighted minor-closed class, Random cubic planar graphs revisited, Enumerations, forbidden subgraph characterizations, and the split-decomposition, Symmetries of unlabelled planar triangulations, Enumeration of chordal planar graphs and maps, Maximal independent sets and maximal matchings in series-parallel and related graph classes, Asymptotic enumeration and limit laws for graphs of fixed genus, Local convergence of random planar graphs, Graph classes with given 3-connected components: Asymptotic enumeration and random graphs, The maximum degree of random planar graphs
