Degree bounded spanning trees

DOI10.1007/s00373-010-0941-xzbMath1221.05050OpenAlexW2044691815MaRDI QIDQ605003

Hajime Matsumura, Tomoki Yamashita, Jun Fujisawa

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0941-x

zbMATH Keywords

independence numberspanning treetotal excessdegree bounded treedegree sum condition

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (7)

A \(k\)-tree containing specified vertices ⋮ Spanning trees: A survey ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ On spanning trees with few branch vertices ⋮ Closure and spanning trees with bounded total excess ⋮ Spanning trees with a bounded number of branch vertices in a claw-free graph ⋮ Spanning \(k\)-ended trees in quasi-claw-free graphs

Cites Work

• On degree sum conditions for long cycles and cycles through specified vertices
• On a connection between the existence of k-trees and the toughness of a graph
• Spanning trees with bounded degrees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Spanning trees with few leaves
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• Toughness, trees, and walks
• On the largest tree of given maximum degree in a connected graph
• A sufficient condition for a graph to have a \(k\)-tree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree bounded spanning trees