Inversion of cycle index sum relations for 2- and 3-connected graphs

DOI10.1006/jctb.1993.1022zbMath0728.05026OpenAlexW2000235890MaRDI QIDQ804584

Robert W. Robinson, Timothy R. S. Walsh

Publication date: 1993

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

Full work available at URL: https://semanticscholar.org/paper/3128f10e0c3ef79a078b4dc59c77f792e7e9c502

zbMATH Keywords

enumerationcountinginversionformal power seriescycle indexunlabeled graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Related Items (4)

Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions ⋮ Efficient counting of degree sequences ⋮ Efficient enumeration of sensed planar maps ⋮ Structure and enumeration of two-connected graphs with prescribed three-connected components

This page was built for publication: Inversion of cycle index sum relations for 2- and 3-connected graphs