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

DOI10.1006/JCTB.1993.1022zbMATH Open0728.05026OpenAlexW2000235890MaRDI QIDQ804584FDOQ804584

Authors: R. 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

Recommendations

• scientific article; zbMATH DE number 1735656
• Publication:4945873
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• scientific article; zbMATH DE number 4152411
• Generating connected and 2-edge connected graphs

zbMATH Keywords

enumerationformal power seriescountinginversioncycle indexunlabeled graphs

Mathematics Subject Classification ID

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

Cited In (8)

• Generating connected and 2-edge connected graphs
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• The chromatic polynomial of an unlabeled graph
• Efficient enumeration of sensed planar maps
• Title not available (Why is that?)
• The second Riddell relation and its consequences
• Counting unlabelled toroidal graphs with no \(K_{3,3}\)-subdivisions
• Efficient counting of degree sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804584)