On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)

DOI10.7151/dmgt.1778zbMath1307.05052OpenAlexW2028626464MaRDI QIDQ2259579

Hajime Matsumura

Publication date: 4 March 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1778

zbMATH Keywords

spanning treedegree bounded treedegree sum condition

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (2)

The existence of \(f\)-forests and \(f\)-trees in graphs ⋮ On a spanning \(K\)-tree containing specified vertices in a graph

Cites Work

• Hamilton connected graphs
• On a \(k\)-tree containing specified leaves in a graph
• Degree conditions and degree bounded trees
• On a connection between the existence of k-trees and the toughness of a graph
• Spanning trees with bounded degrees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Connected (g, f)-factors
• The independence number condition for the existence of a spanning f-tree
• Note on Hamilton Circuits

This page was built for publication: On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)