Enumeration of cubic graphs by inclusion-exclusion
From MaRDI portal
Publication:1284476
DOI10.1006/JCTA.1998.2923zbMATH Open0918.05064OpenAlexW1967197050MaRDI QIDQ1284476FDOQ1284476
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Symmetric functions and P-recursiveness
- Differentiably finite power series
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- A holonomic systems approach to special functions identities
- Title not available (Why is that?)
- Title not available (Why is that?)
- The asymptotic number of labeled graphs with given degree sequences
- The Enumeration of Locally Restricted Graphs (I)
- The Enumeration of Locally Restricted Graphs (II)
- Labelled Graphs with Small Vertex Degrees and P-Recursiveness
- On the Foundation of Combinatorial Theory. X. A Categorical Setting for Symmetric Functions
- Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity
- Title not available (Why is that?)
- The asymptotic number of claw-free cubic graphs.
Cited In (3)
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)