Spanning trees with few leaves

DOI10.1007/s00373-007-0751-yzbMath1127.05023OpenAlexW2058894268MaRDI QIDQ2464051

Tomoki Yamashita, Masao Tsugaki

Publication date: 10 December 2007

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

Full work available at URL: https://doi.org/10.1007/s00373-007-0751-y

zbMATH Keywords

spanning treefew leavesDegree sum condition

Mathematics Subject Classification ID

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

Related Items (8)

Unrooted non-binary tree-based phylogenetic networks ⋮ Degree bounded spanning trees ⋮ Spectral radius and spanning trees of graphs ⋮ Spanning trees with small degrees and few leaves ⋮ Spanning trees: A survey ⋮ Unnamed Item ⋮ On spanning trees with few branch vertices ⋮ Spanning trees with a bounded number of branch vertices in a claw-free graph

Cites Work

• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Note on Hamilton Circuits
• Independence trees and Hamilton cycles

This page was built for publication: Spanning trees with few leaves