A toughness condition for a spanning tree with bounded total excesses

DOI10.1007/S00373-014-1487-0MaRDI QIDQ497366zbMATH OpenOpenAlexFDO

Authors 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

toughnessspanning \(k\)-treestotal excess

Mathematics Subject Classification ID

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

Recommendations

• Spanning trees with bounded total excess.
• A note on total excess of spanning trees
• Closure and spanning trees with bounded total excess
• scientific article; zbMATH DE number 434863
• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)

Cites work

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

Cited in

(2)

• Closure and spanning trees with bounded total excess
• Spanning trees with bounded total excess.

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

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