Enumeration of cubic graphs by inclusion-exclusion

DOI10.1006/JCTA.1998.2923MaRDI QIDQ1284476zbMATH OpenOpenAlexFDO

Authors William Y. C. Chen, J. D. Louck

Publication date 12 August 1999

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

Full work available at URL https://doi.org/10.1006/jcta.1998.2923

zbMATH Keywords

generating functionscubic graphsinclusion and exclusion

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• Inclusion and exclusion for finitely many types of properties
• Counting labeled general cubic graphs
• Enumeration of cyclically 4-connected cubic graphs
• An Operator Approach to the Principle of Inclusion and Exclusion
• Counting Claw-Free Cubic Graphs

Cites work

• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 3743203 (Why is no real title available?)
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• scientific article; zbMATH DE number 1486067 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A holonomic systems approach to special functions identities
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Differentiably finite power series
• Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity
• Labelled Graphs with Small Vertex Degrees and P-Recursiveness
• On the Foundation of Combinatorial Theory. X. A Categorical Setting for Symmetric Functions
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Symmetric functions and P-recursiveness
• The Enumeration of Locally Restricted Graphs (I)
• The Enumeration of Locally Restricted Graphs (II)
• The asymptotic number of claw-free cubic graphs.
• The asymptotic number of labeled graphs with given degree sequences

Cited in

(3)

• Inclusion and exclusion for finitely many types of properties
• Enumeration of rooted nearly cubic \(c\)-nets
• An Operator Approach to the Principle of Inclusion and Exclusion

This page was built for publication: Enumeration of cubic graphs by inclusion-exclusion

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