On enumeration of labelled connected graphs by the number of cutpoints

DOI10.1515/DMA.2008.004zbMath1171.05345MaRDI QIDQ3184516

No author found.

Publication date: 21 October 2009

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• The enumeration of labeled graphs by number of cutpoints
• COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I
• The number of connected sparsely edged graphs. II. Smooth graphs and blocks
• A Relationship Between two Sequences

Related Items (3)

Enumeration of labeled connected graphs with given order and size ⋮ The Second Riddell Relation and Its Consequences ⋮ Enumeration of labeled, connected, homeomorphically irreducible graphs

This page was built for publication: On enumeration of labelled connected graphs by the number of cutpoints