On spanning trees with few branch vertices
From MaRDI portal
Publication:2279263
DOI10.1016/J.DISC.2019.06.037zbMATH Open1429.05040OpenAlexW2979533220WikidataQ127120022 ScholiaQ127120022MaRDI QIDQ2279263FDOQ2279263
Publication date: 12 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.06.037
Recommendations
- scientific article; zbMATH DE number 7132826
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- Spanning trees with a bounded number of leaves in a claw-free graph.
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
- Spanning trees with few leaves in almost claw-free graphs
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
- Spanning trees: A survey
- 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
- Title not available (Why is that?)
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
- Degree bounded spanning trees
- Spanning trees with a bounded number of branch vertices in a claw-free graph
Cited In (11)
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spanning Trees with Few Branch Vertices
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
- Title not available (Why is that?)
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves
- Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs
- Spanning trees with few peripheral branch vertices in a connected claw-free graph
This page was built for publication: On spanning trees with few branch vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279263)
