Counting labelled 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) , 1-11
- https://doi.org/10.1016/0095-8956(82)90072-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Counting unlabelled three-connected and homeomorphically irreducible two-connected graphsJournal of Combinatorial Theory, Series B, 1982
- A Combinatorial Decomposition TheoryCanadian Journal of Mathematics, 1980
- The exponential generating function of labelled blocksDiscrete Mathematics, 1979
- Enumeration of Labelled Graphs I: 3-Connected GraphsJournal of the London Mathematical Society, 1979
- The enumeration of homeomorphically irreducible labelled graphsJournal of Combinatorial Theory, Series B, 1975
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Graphs Suppressible to an EdgeCanadian Mathematical Bulletin, 1972
- Enumeration of non-separable graphsJournal of Combinatorial Theory, 1970
- A Census of Planar MapsCanadian Journal of Mathematics, 1963
- Enumeration Of Labelled GraphsCanadian Journal of Mathematics, 1956