On a spanning tree with specified leaves

DOI10.1007/S00373-007-0768-2MaRDI QIDQ2482350zbMATH OpenOpenAlexFDO

Authors Yoshimi Egawa, Haruhide Matsuda, 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-connectedHamilton pathleaf-connected

Mathematics Subject Classification ID

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

Recommendations

• On a k-tree containing specified leaves in a graph
• Spanning trees homeomorphic to a small tree
• Spanning trees with few leaves
• Spanning trees of bounded degree
• On a spanning \(K\)-tree containing specified vertices in a graph

Cites work

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

Cited in

(12)

• Flexible List Colorings in Graphs with Special Degeneracy Conditions
• Spanning trees with small degrees and few leaves
• Spanning trees: A survey
• Spanning trees with leaf distance at least four
• Leafy spanning arborescences in DAGs
• Leafy spanning arborescences in DAGs
• Spanning trees homeomorphic to a small tree
• Trees through specified vertices
• On sufficient conditions for \(k\)-leaf-connected graphs
• Flexible list colorings in graphs with special degeneracy conditions
• On a spanning tree with specified leaves in a bipartite graph
• A Fan-type condition for graphs to be \(k\)-leaf-connected

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

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