On spanning trees with restricted degrees

DOI10.1016/S0020-0190(00)00018-1zbMath1339.05055MaRDI QIDQ294729

Kiyoshi Yoshimoto, Atsushi Kaneko

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000181?np=y

zbMATH Keywords

combinatorial problemsspanning trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees ⋮ Spanning trees with disjoint dominating and 2-dominating sets ⋮ Spanning Trees with Vertices Having Large Degrees

Cites Work

• Spanning trees with pairwise nonadjacent endvertices
• Factors and factorizations of graphs—a survey
• On Representatives of Subsets

This page was built for publication: On spanning trees with restricted degrees