Counting labelled three-connected and homeomorphically irreducible two- connected graphs
type: Item
instance of: scholarly article
title: Counting labelled three-connected and homeomorphically irreducible two- connected graphs
zbMATH Open document ID: 0449.05031
DOI: 10.1016/0095-8956(82)90072-7
published in: Journal of Combinatorial Theory. Series B
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 3702698
zbMATH Keywords: enumeration
zbMATH Keywords: labelled three-connected graphs
zbMATH Keywords: labelled two-connected graphs
author: Timothy R. S. Walsh
MaRDI profile type: Publication
full work available at URL: 0095-8956(82)90072-7
OpenAlex ID: W2080171801
cites work: Q4165400
cites work: A Combinatorial Decomposition Theory
cites work: Enumeration Of Labelled Graphs
cites work: Graphs Suppressible to an Edge
cites work: Q5682013
cites work: The enumeration of homeomorphically irreducible labelled graphs
cites work: Q3268316
cites work: Enumeration of non-separable graphs
cites work: Dividing a Graph into Triconnected Components
cites work: On the Enumeration of Mayer Cluster Integrals
cites work: Q3268317
cites work: Q5524326
cites work: A Census of Planar Maps
cites work: Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
cites work: Enumeration of Labelled Graphs I: 3-Connected Graphs
cites work: The exponential generating function of labelled blocks
description: scientific article; zbMATH DE number 3702698