A toughness condition for a spanning tree with bounded total excesses

DOI10.1007/s00373-014-1487-0zbMath1321.05048OpenAlexW2000679221MaRDI QIDQ497366

Kenta Ozeki

Publication date: 24 September 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-014-1487-0

zbMATH Keywords

total excesstoughnessspanning \(k\)-trees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (1)

Closure and spanning trees with bounded total excess

Cites Work

• Planar graphs without adjacent cycles of length at most seven are 3-colorable
• On a connection between the existence of k-trees and the toughness of a graph
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Connected (g, f)-factors
• Toughness, trees, and walks
• Unnamed Item

This page was built for publication: A toughness condition for a spanning tree with bounded total excesses