Spanning trees with a bounded number of branch vertices in a claw-free graph
From MaRDI portal
(Redirected from Publication:742583)
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
- scientific article; zbMATH DE number 2038756 (Why is no real title available?)
- scientific article; zbMATH DE number 2086635 (Why is no real title available?)
- Degree bounded spanning trees
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
- Independence trees and Hamilton cycles
- Longest paths and cycles in K1,3-free graphs
- Neighborhood unions and extremal 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 spiders and light-splitting switches
- Spanning trees with a bounded number of leaves in a claw-free graph.
- Spanning trees with bounded degrees
- Spanning trees with few leaves
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
- scientific article; zbMATH DE number 6770068 (Why is no real title available?)
- 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 a bounded number of leaves in a claw-free graph.
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs
- 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)
