On trees of a graph and their generation

DOI10.1016/0016-0032(61)90036-9zbMath0137.43003OpenAlexW2100831780MaRDI QIDQ2521783

S. Louis Hakimi

Publication date: 1961

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

Full work available at URL: https://doi.org/10.1016/0016-0032(61)90036-9

zbMATH Keywords

topology

Related Items (10)

On Connectedness and Trees of an N-graph ⋮ Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract) ⋮ Enumeration of spanning trees containing given subtrees ⋮ A pivot Gray code listing for the spanning trees of the fan graph ⋮ On the complexity of the robust spanning tree problem with interval data ⋮ Generating formulas for the number of trees in a graph ⋮ On two-tree transformations and the separation of two-tree sets ⋮ Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph ⋮ Enumeration of spanning trees containing given subgraphs ⋮ On the graph for which there is a tree as the inverse interchange graph of a local graph

Cites Work

• Graphs with two kinds of elements
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Unnamed Item

This page was built for publication: On trees of a graph and their generation