On a spanning tree with specified leaves

DOI10.1007/s00373-007-0768-2zbMath1147.05046OpenAlexW2060648678MaRDI QIDQ2482350

Haruhide Matsuda, Yoshimi Egawa, Tomoki Yamashita, Kiyoshi Yoshimoto

Publication date: 16 April 2008

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0768-2

zbMATH Keywords

spanning treeHamilton pathHamilton-connectedleaf-connected

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Unnamed Item ⋮ A Fan-type condition for graphs to be \(k\)-leaf-connected ⋮ Flexible list colorings in graphs with special degeneracy conditions ⋮ Spanning trees with small degrees and few leaves ⋮ Spanning trees: A survey ⋮ Flexible List Colorings in Graphs with Special Degeneracy Conditions

Cites Work

• Hamilton connected graphs
• On k-leaf-connected graphs
• Independence trees and Hamilton cycles

This page was built for publication: On a spanning tree with specified leaves