Spanning trees with a bounded number of branch vertices in a claw-free graph
From MaRDI portal
Publication:742583
DOI10.1007/S00373-012-1277-5zbMath1298.05074OpenAlexW2006474823MaRDI QIDQ742583
Kenta Ozeki, Haruhide Matsuda, Tomoki Yamashita
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1277-5
Related Items (13)
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices ⋮ Spanning trees whose stems are spiders ⋮ Decomposition methods based on articulation vertices for degree-dependent spanning tree problems ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity ⋮ Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning 3-ended trees in almost claw-free graphs ⋮ Spanning trees: A survey ⋮ On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices ⋮ On spanning trees with few branch vertices ⋮ Spanning trees whose stems have a bounded number of branch vertices ⋮ The existence of spanning ended system on claw-free graphs ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ The distance spectral radius of graphs with given number of odd vertices
Cites Work
- Degree bounded spanning trees
- On a \(k\)-tree containing specified leaves in a graph
- On a conjecture of Las Vergnas concerning certain spanning trees in graphs
- Spanning trees with bounded degrees
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
- Spanning spiders and light-splitting switches
- Neighborhood unions and extremal spanning trees
- Spanning trees with few leaves
- Longest paths and cycles in K1,3-free graphs
- Independence trees and Hamilton cycles
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Spanning trees with a bounded number of branch vertices in a claw-free graph
