Numbers of cubic graphs
- 1 December 1983
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 7 (4) , 463-467
- https://doi.org/10.1002/jgt.3190070412
Abstract
The numbers of unlabeled cubic graphs on p = 2n points have been found by two different counting methods, the best of which has given values for p ≦ 40.Keywords
This publication has 9 references indexed in Scilit:
- Counting unlabelled three-connected and homeomorphically irreducible two-connected graphsJournal of Combinatorial Theory, Series B, 1982
- Counting the 10-point graphs by partitionJournal of Graph Theory, 1981
- Number of labeled 4-regular graphsJournal of Graph Theory, 1980
- Enumeration of Labelled Graphs II: Cubic Graphs with a given ConnectivityJournal of the London Mathematical Society, 1979
- Cubic graphs on ≤14 verticesJournal of Combinatorial Theory, Series B, 1977
- Counting cubic graphsJournal of Graph Theory, 1977
- Enumeration of non-separable graphsJournal of Combinatorial Theory, 1970
- Some Unusual Enumeration ProblemsAnnals of the New York Academy of Sciences, 1970
- The Enumeration of Locally Restricted Graphs (II)Journal of the London Mathematical Society, 1960