Closure and spanning trees with bounded total excess

DOI10.1007/S00373-021-02283-ZMaRDI QIDQ2045377zbMATH OpenOpenAlexFDO

Authors Shun-ichi Maezawa, Masao Tsugaki, Takamasa Yashima

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

\(k\)-ended tree\(k\)-treeclosuredegree sumspanning treetotal excess

Mathematics Subject Classification ID

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

Recommendations

• Spanning trees with bounded total excess.
• A toughness condition for a spanning tree with bounded total excesses
• Closure and spanning \(k\)-trees
• Spanning \(k\)-trees of \(n\)-connected graphs
• A note on total excess of spanning trees

Cites work

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

Cited in

(6)

• The Serial Transitive Closure Problem for Trees
• Spanning trees with bounded total excess.
• A toughness condition for a spanning tree with bounded total excesses
• A note on total excess of spanning trees
• A result on spanning trees with bounded total excess
• Closure and spanning \(k\)-trees

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

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