A note on leaf-constrained spanning trees in a graph

MaRDI QIDQ5397235zbMATH OpenFDO

Authors Aung Kyaw, Mikio Kano

Publication date 19 February 2014

zbMATH Keywords

independent setspanning tree\(k\)-frame

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A condition ensuring that a connected graph has a spanning tree with few leaves
• Spanning trees with few leaves
• Spanning trees whose stems have at most \(k\) leaves.
• Spanning trees with constraints on the leaf degree
• Spanning trees with a bounded number of leaves

Cited in

(3)

• On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
• scientific article; zbMATH DE number 2192218 (Why is no real title available?)
• A condition ensuring that a connected graph has a spanning tree with few leaves

This page was built for publication: A note on leaf-constrained spanning trees in a graph

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