A note on total excess of spanning trees

MaRDI QIDQ647240zbMATH OpenFDO

Authors Y. Ohnishi, Katsuhiro Ota, Kenta Ozeki

Publication date 1 December 2011

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

spanning treestoughnesstotal excess

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• Spanning trees with bounded total excess.
• Closure and spanning trees with bounded total excess
• scientific article; zbMATH DE number 3966094
• Some results on spanning trees
• scientific article; zbMATH DE number 5584928
• NOTE ON THE SPANNING TREES AND COTREES OF A CONNECTED GRAPH
• A note on spanning trees with a specified degree sequence
• The number of spanning trees in some classes of graphs
• Spanning \(k\)-trees of \(n\)-connected graphs
• Some exact results for spanning trees on lattices

Cited in

(3)

• Closure and spanning trees with bounded total excess
• Spanning trees with bounded total excess.
• A toughness condition for a spanning tree with bounded total excesses

This page was built for publication: A note on total excess of spanning trees

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