On trees of a graph and their generation

DOI10.1016/0016-0032(61)90036-9MaRDI QIDQ2521783zbMATH OpenOpenAlexFDO

Authors 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

Cites work

• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Graphs with two kinds of elements
• scientific article; zbMATH DE number 3167398 (Why is no real title available?)

Cited in

(12)

• On the complexity of the robust spanning tree problem with interval data
• Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
• Generating formulas for the number of trees in a graph
• On two-tree transformations and the separation of two-tree sets
• 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
• A pivot Gray code listing for the spanning trees of the fan graph
• Enumeration of spanning trees containing given subtrees
• On Connectedness and Trees of an N-graph
• Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract)
• Pivot Gray codes for the spanning trees of a graph ft. the fan
• Efficiently enumerating spanning trees of k-trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2521783)