A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees

DOI10.1007/s00493-014-2576-7zbMath1324.05024OpenAlexW2002554706MaRDI QIDQ397062

Kenta Ozeki, Yoshimi Egawa

Publication date: 14 August 2014

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-014-2576-7

zbMATH Keywords

degreeindependent setspanning treeconnected simple graph

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (3)

Spanning trees: A survey ⋮ Spanning tree with lower bound on the degrees ⋮ Spanning Trees with Vertices Having Large Degrees

Cites Work

• Unnamed Item
• On spanning trees with restricted degrees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)

This page was built for publication: A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees