Enumeration of cubic graphs by inclusion-exclusion
From MaRDI portal
Publication:1284476
DOI10.1006/jcta.1998.2923zbMath0918.05064OpenAlexW1967197050MaRDI QIDQ1284476
William Y. C. Chen, James 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The asymptotic number of labeled graphs with given degree sequences
- The asymptotic number of claw-free cubic graphs.
- The Enumeration of Locally Restricted Graphs (I)
- 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
- The Enumeration of Locally Restricted Graphs (II)
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
