Closure and spanning \(k\)-trees

DOI10.1007/s00373-013-1314-zzbMath1298.05073OpenAlexW2078780445WikidataQ59395839 ScholiaQ59395839MaRDI QIDQ742606

Masao Tsugaki, Ryota Matsubara, Tomoki Yamashita

Publication date: 19 September 2014

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

Full work available at URL: https://doi.org/10.1007/s00373-013-1314-z

zbMATH Keywords

spanning tree\(k\)-treeclosure

Mathematics Subject Classification ID

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

Related Items

Spanning k-tree with specified vertices ⋮ Closure and spanning trees with bounded total excess

Cites Work

• Unnamed Item
• Spanning \(k\)-trees of \(n\)-connected graphs
• Spanning trees with bounded degrees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• A method in graph theory
• Closure concepts: A survey

This page was built for publication: Closure and spanning \(k\)-trees