Spanning Trees with Few Branch Vertices
From MaRDI portal
Publication:5232165
DOI10.1137/17M1152759zbMath1419.05044arXiv1709.04937OpenAlexW2969384513MaRDI QIDQ5232165
Publication date: 29 August 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.04937
Related Items (3)
An improvement on Łuczak's connected matchings method ⋮ The generalized minimum branch vertices problem: properties and polyhedral analysis ⋮ Matchings with few colors in colored complete graphs and hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem
- Monochromatic cycle partitions of graphs with large minimum degree
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Bounded-degree spanning tree problems: models and new algorithms
- Spanning trees: A survey
- The 3-colored Ramsey number of even cycles
- Fractional matchings and the Edmonds-Gallai theorem
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
- Spanning spiders and light-splitting switches
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- Approximating spanning trees with few branches
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
- Neighborhood unions and extremal spanning trees
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- Degree Conditions for Spanning Brooms
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Embedding large subgraphs into dense graphs
- Independence trees and Hamilton cycles
- Cycle packing
- Paths, Trees, and Flowers
- Some Theorems on Abstract Graphs
This page was built for publication: Spanning Trees with Few Branch Vertices
