Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs

DOI10.1016/0095-8956(82)90073-9zbMath0449.05032OpenAlexW4237443073MaRDI QIDQ1147158

Timothy R. S. Walsh

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)90073-9

zbMATH Keywords

enumerationcounting isomorphism classes of three-connected graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items

Generating labeled planar graphs uniformly at random, Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions, 3-connected reduction for regular graph covers, Jordan-like characterization of automorphism groups of planar graphs, Counting non-isomorphic three-connected planar maps, Counting labelled three-connected and homeomorphically irreducible two- connected graphs, Symmetries of unlabelled planar triangulations, On the Diameter of Random Planar Graphs, Efficient counting of degree sequences, Efficient enumeration of sensed planar maps, Maximal independent sets and maximal matchings in series-parallel and related graph classes, Generating unlabeled connected cubic planar graphs uniformly at random, Graph isomorphism restricted by lists, Asymptotic enumeration and limit laws of planar graphs, Structure and enumeration of two-connected graphs with prescribed three-connected components, Counting bridgeless graphs, The structure and unlabelled enumeration of toroidal graphs with no K3,3's

Cites Work

• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• A Combinatorial Decomposition Theory
• Dividing a Graph into Triconnected Components
• Enumeration of non-separable graphs
• Graphs Suppressible to an Edge
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item