Closure and spanning trees with bounded total excess

DOI10.1007/s00373-021-02283-zzbMath1470.05034OpenAlexW3130526028MaRDI QIDQ2045377

Takamasa Yashima, Masao Tsugaki, Shun-ichi Maezawa

Publication date: 12 August 2021

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02283-z

zbMATH Keywords

spanning tree\(k\)-treedegree sumtotal excessclosure\(k\)-ended tree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• A toughness condition for a spanning tree with bounded total excesses
• Degree bounded spanning trees
• A note on total excess of spanning trees
• Closure and spanning \(k\)-trees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• A method in graph theory
• Maximal trees with bounded maximum degree in a graph
• Closure concepts: A survey
• Note on Hamilton Circuits
• Independence trees and Hamilton cycles

This page was built for publication: Closure and spanning trees with bounded total excess