On spanning trees with restricted degrees

DOI10.1016/S0020-0190(00)00018-1zbMATH Open1339.05055MaRDI QIDQ294729FDOQ294729

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

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

zbMATH Keywords

spanning treescombinatorial problems

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

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

Cited In (11)

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

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)