Structure and enumeration of two-connected graphs with prescribed three-connected components

DOI10.1016/j.aam.2009.01.002zbMath1228.05172arXiv0712.1869OpenAlexW3101855936MaRDI QIDQ1023394

J. Martínez

Publication date: 11 June 2009

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

enumeration2-treescombinatorial speciesdissymmetry theorem3-connected decomposition

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (8)

The mathematical life of Pierre Leroux ⋮ Local convergence of random planar graphs ⋮ On Spiro and polyphenyl hexagonal chains with respect to the number of BC-subtrees ⋮ Multi-distance granularity structural \(\alpha \)-subtree index of generalized Bethe trees ⋮ Graph classes with given 3-connected components: Asymptotic enumeration and random graphs ⋮ Enumeration of BC-subtrees of trees ⋮ On enumerating algorithms of novel multiple leaf-distance granular regular \(\alpha\)-subtrees of trees ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs

Uses Software

• OEIS
• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The specification of 2-trees
• Inversion of cycle index sum relations for 2- and 3-connected graphs
• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
• Counting unrooted planar maps
• Une théorie combinatoire des séries formelles
• Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
• The number of labeled 2-connected planar graphs
• Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions
• The structure of \(K_{3,3}\)-subdivision-free toroidal graphs
• A structural characterization of planar combinatorial graphs
• The number of trees
• Graph classes with given 3-connected components: asymptotic counting and critical phenomena
• A Combinatorial Decomposition Theory
• On the Tumber of Planar Maps
• Dividing a Graph into Triconnected Components
• Enumeration of non-separable graphs

This page was built for publication: Structure and enumeration of two-connected graphs with prescribed three-connected components