Spanning trees with a bounded number of branch vertices in a claw-free graph
From MaRDI portal
Publication:742583
DOI10.1007/S00373-012-1277-5zbMATH Open1298.05074OpenAlexW2006474823MaRDI QIDQ742583FDOQ742583
Authors: Haruhide Matsuda, Kenta Ozeki, 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
Recommendations
- Spanning trees with a bounded number of leaves in a claw-free graph.
- Spanning trees with few peripheral branch vertices in a connected claw-free graph
- Spanning trees with few leaves in almost claw-free graphs
- scientific article; zbMATH DE number 2086635
- Spanning \(k\)-ended trees of a claw-free graph
- Spanning trees whose stems have a bounded number of branch vertices
- Spanning \(k\)-ended trees in quasi-claw-free graphs
- scientific article; zbMATH DE number 140465
- On spanning trees with few branch vertices
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
Cites Work
- Longest paths and cycles in K1,3-free graphs
- On a conjecture of Las Vergnas concerning certain spanning trees in graphs
- Spanning trees with bounded degrees
- On a \(k\)-tree containing specified leaves in a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Independence trees and Hamilton cycles
- Spanning trees with few leaves
- Spanning spiders and light-splitting switches
- Neighborhood unions and extremal spanning trees
- Spanning trees with a bounded number of leaves in a claw-free graph.
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
- Degree bounded spanning trees
Cited In (19)
- Spanning 3-ended trees in almost claw-free graphs
- On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
- Spanning trees: A survey
- Spanning trees whose stems have a bounded number of branch vertices
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
- Title not available (Why is that?)
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
- Spanning trees whose stems are spiders
- The existence of spanning ended system on claw-free graphs
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems
- On spanning trees with few branch vertices
- Spanning \(k\)-ended trees in quasi-claw-free graphs
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs
- Spanning trees with a bounded number of leaves in a claw-free graph.
- The distance spectral radius of graphs with given number of odd vertices
- Spanning trees with few peripheral branch vertices in a connected claw-free graph
This page was built for publication: Spanning trees with a bounded number of branch vertices in a claw-free graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742583)
