A complete grammar for decomposing a family of graphs into 3-connected components
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 enumerationgraph decompositiongrammar3-connected componentsbijective construction of planar graphsdissymmetry theoremfamily of graphsseries counting labellled planar graphssubfamily of graphssymbolic combinatoricsunlabelled planar graphs
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Asymptotic enumeration (05A16) Connectivity (05C40)
Related Items (15)
This page was built for publication: A complete grammar for decomposing a family of graphs into 3-connected components