Spanning trees with leaf distance at least four

DOI10.1002/JGT.20221MaRDI QIDQ3445504zbMATH OpenOpenAlexFDO

Authors Atsushi Kaneko, Kazuhiro Suzuki, Mikio Kano

Publication date 11 June 2007

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20221

zbMATH Keywords

leafleaf distancespanning tree

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Spanning trees with leaf distance at least \(d\)
• Spanning trees with many leaves and average distance
• Spanning trees with a bounded number of leaves
• Spanning trees with few leaves
• Spanning trees with few non-leaves
• Spanning trees with bounded degrees and leaves
• On a spanning tree with specified leaves
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees with many leaves
• Spanning trees with many leaves

Cited in

(6)

• Spanning trees with leaf distance at least \(d\)
• A condition ensuring that a connected graph has a spanning tree with few leaves
• scientific article; zbMATH DE number 3991551 (Why is no real title available?)
• Spanning trees: A survey
• Spanning subgraphs and spectral radius in graphs
• Sufficient conditions for spanning trees with constrained leaf distance in a graph

This page was built for publication: Spanning trees with leaf distance at least four

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