Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs
- 1 February 1982
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 32 (1) , 12-32
- https://doi.org/10.1016/0095-8956(82)90073-9
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Counting labelled three-connected and homeomorphically irreducible two-connected graphsJournal of Combinatorial Theory, Series B, 1982
- A Combinatorial Decomposition TheoryCanadian Journal of Mathematics, 1980
- Graphs Suppressible to an EdgeCanadian Mathematical Bulletin, 1972
- Enumeration of non-separable graphsJournal of Combinatorial Theory, 1970
- A structural characterization of planar combinatorial graphsDuke Mathematical Journal, 1937