Spanning trees with leaf distance at least four

DOI10.1002/JGT.20221zbMATH Open1119.05023OpenAlexW4249047189MaRDI QIDQ3445504FDOQ3445504

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

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

zbMATH Keywords

leafspanning treeleaf distance

Mathematics Subject Classification ID

Trees (05C05)

Cited In (4)

• Spanning trees: A survey
• Spanning trees with leaf distance at least \(d\)
• A condition ensuring that a connected graph has a spanning tree with few leaves
• Title not available (Why is that?)

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)