Enumeration of labeled, connected, homeomorphically irreducible graphs

DOI10.1007/BF01158294zbMath0751.05054OpenAlexW2012745854MaRDI QIDQ1814542

V. A. Voblyj

Publication date: 25 June 1992

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158294

zbMATH Keywords

enumerationsparse graphshomeomorphically irreducible graphshomeomorphically irreducible trees

Mathematics Subject Classification ID

Trees (05C05) Bell and Stirling numbers (11B73) Enumeration in graph theory (05C30)

Cites Work

• Asymptotic Methods in Enumeration
• On nodes of degree two in random trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of labeled, connected, homeomorphically irreducible graphs