@article{WALSH19821,
Abstract = {Labelled three-connected graphs and labelled two-connected graphs with no vertices of degree 2 are counted using methods similar to those used by Riddell to count labelled two-connected graphs.},
Author = {Walsh, T.R.S},
File = {Counting labelled three-connected and homeomorphically irreducible two-connected graphs - 1-s2.0-0095895682900727-main.pdf},
ISSN = {0095-8956},
Journal = {Journal of Combinatorial Theory, Series B},
Number = {1},
Pages = {1-11},
Title = {Counting labelled three-connected and homeomorphically irreducible two-connected graphs},
URL = {https://www.sciencedirect.com/science/article/pii/0095895682900727},
Volume = {32},
Year = {1982},
bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/0095895682900727},
bdsk-url-2 = {https://doi.org/10.1016/0095-8956(82)90072-7},
date-added = {2023-03-01 16:23:07 +0100},
date-modified = {2023-03-01 16:23:07 +0100},
doi = {10.1016/0095-8956(82)90072-7}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A