Spanning trees with few peripheral branch vertices
From MaRDI portal
Publication:2233620
For a graph \(G\), the authors prove sufficient conditions for the existence of a spanning tree \(T\) with few peripheral branch vertices, where a peripheral branch vertex of \(T\) is a leaf of its reducible stem. The conditions are formulated as bounds for the independence number and for the degree sum of \(G\).
Recommendations
- Spanning trees whose reducible stems have a few branch vertices.
- Spanning trees whose stems have a bounded number of branch vertices
- scientific article; zbMATH DE number 6424518
- Spanning trees whose stems have at most k leaves.
- Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
Cites work
- Degree conditions for graphs to have spanning trees with few branch vertices and leaves
- Hamiltonian results inK1,3-free graphs
- scientific article; zbMATH DE number 6424518 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3349867 (Why is no real title available?)
- Independence trees and Hamilton cycles
- On a conjecture of Las Vergnas concerning certain spanning trees in graphs
- Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
- Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
- Spanning trees whose stems are spiders
- Spanning trees whose stems have a bounded number of branch vertices
- Spanning trees whose stems have at most k leaves.
- Spanning trees with a bounded number of leaves in a claw-free graph.
- Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
- Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
- Spanning trees: A survey
Cited in
(7)- Degree conditions for graphs to have spanning trees with few branch vertices and leaves
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves
- Spanning trees with few peripheral branch vertices in a connected claw-free graph
- Spanning trees whose reducible stems have a few branch vertices.
- scientific article; zbMATH DE number 6424518 (Why is no real title available?)
- Spanning Trees with Few Branch Vertices
- Spanning trees whose stems have a bounded number of branch vertices
This page was built for publication: Spanning trees with few peripheral branch vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233620)
