Degree-preserving spanning trees in small-degree graphs

DOI10.1016/S0012-365X(00)00005-4zbMath0965.05035OpenAlexW2058281654WikidataQ127481587 ScholiaQ127481587MaRDI QIDQ1579547

Peter Damaschke

Publication date: 2 August 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00005-4

zbMATH Keywords

Steiner problemplanar graphsspanning tree

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Small degree out‐branchings ⋮ Spanning trees: A survey ⋮ The degree-preserving spanning tree problem in strongly chordal and directed path graphs

This page was built for publication: Degree-preserving spanning trees in small-degree graphs