Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs

DOI10.1007/s00373-014-1434-0zbMath1321.05049OpenAlexW35654498MaRDI QIDQ497365

Takeshi Sugiyama, Kenta Ozeki

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1434-0

zbMATH Keywords

degree sum\(k\)-trees\(k\)-forestsstar-free graphs

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree bounded spanning trees
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• A lower bound for the circumference of a graph
• Maximal trees with bounded maximum degree in a graph
• Claw-free graphs---a survey
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs
• Long paths and cycles in tough graphs
• Note on Hamilton Circuits
• Longest paths and cycles in K1,3-free graphs
• Extremal problems involving neighborhood unions
• On the Shannon capacity of a graph
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Some Theorems on Abstract Graphs
• A sufficient condition for a graph to have a \(k\)-tree
• Path factors in claw-free graphs

This page was built for publication: Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs