Enumeration of spanning trees containing given subgraphs

DOI10.1016/0016-0032(70)90193-6zbMath0229.05121OpenAlexW2003502901WikidataQ126590707 ScholiaQ126590707MaRDI QIDQ2550033

P. V. O'Neil

Publication date: 1970

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(70)90193-6

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (4)

Enumeration of spanning trees containing given subtrees ⋮ Число Деревьев Графа, Содержащих Заднный Лес ⋮ Generating formulas for the number of trees in a graph ⋮ Chebyshev polynomials and spanning tree formulas for circulant and related graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On trees of a graph and their generation
• The identification of an incompletely partitioned network

This page was built for publication: Enumeration of spanning trees containing given subgraphs