On spanning trees with restricted degrees

DOI10.1016/S0020-0190(00)00018-1MaRDI QIDQ294729zbMATH OpenFDO

Authors Atsushi Kaneko, Kiyoshi Yoshimoto

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)

Recommendations

• A spanning tree with high degree vertices
• Spanning trees with vertices having large degrees
• The forbiddem subgraphs condition for the existence of spanning f-trees
• A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
• The independence number condition for the existence of a spanning f-tree

Cites work

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

Cited in

(11)

• A note on matchings and spanning trees with bounded degrees
• The existence of \(f\)-forests and \(f\)-trees in graphs
• Spanning trees with disjoint dominating and 2-dominating sets
• Spanning trees and spanning closed walks with small degrees
• The independence number condition for the existence of a spanning f-tree
• A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
• The forbiddem subgraphs condition for the existence of spanning f-trees
• scientific article; zbMATH DE number 7132826 (Why is no real title available?)
• Spanning trees with vertices having large degrees
• Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
• A spanning tree with high degree vertices

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

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