Counting bridgeless graphs

DOI10.1016/0095-8956(82)90048-XzbMath0506.05035OpenAlexW2070299236MaRDI QIDQ1836672

Robert W. Robinson, Philip J. Hanlon

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90048-x

zbMATH Keywords

cycle indexbridgeless graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (6)

On the number of labeled outerplanar $k$-cyclic bridgeless graphs ⋮ Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs ⋮ On the asymptotic enumeration of labeled connected \(k\)-cyclic graphs without bridges ⋮ Enumeration of labeled connected bicyclic and tricyclic graphs without bridges ⋮ Failed disk recovery in double erasure RAID arrays ⋮ Counting bridgeless graphs

Cites Work

• Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
• A cycle index sum inversion theorem
• The exponential generating function of labelled blocks
• Counting bridgeless graphs
• The Möbius function and connected graphs
• The number of trees
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. II
• Dissimilarity Characteristic Theorems for Graphs
• The number of connected sparsely edged graphs
• The k -Connectedness of Unlabelled Graphs
• Enumeration of Labelled Graphs I: 3-Connected Graphs
• Enumeration of non-separable graphs
• Some Unusual Enumeration Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting bridgeless graphs