Spanning trees with vertices having large degrees

DOI10.1002/JGT.21824MaRDI QIDQ5265330zbMATH OpenOpenAlexFDO

Authors Yoshimi Egawa, Kenta Ozeki

Publication date 23 July 2015

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.21824

zbMATH Keywords

degree constraint spanning treesHall-type condition

Mathematics Subject Classification ID

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

Recommendations

• A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
• A spanning tree with high degree vertices
• On spanning trees with restricted degrees
• Degree bounded spanning trees
• scientific article; zbMATH DE number 434863

Cites work

• A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
• Connected (g,f)-factors
• On a connection between the existence of k-trees and the toughness of a graph
• On spanning trees with restricted degrees

Cited in

(8)

• The existence of \(f\)-forests and \(f\)-trees in graphs
• Spanning tree with lower bound on the degrees
• Spanning trees and spanning closed walks with small degrees
• On spanning trees with restricted 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
• A spanning tree with high degree vertices
• Finding a minimum spanning tree with a small non-terminal set

This page was built for publication: Spanning trees with vertices having large degrees

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