Bounded degree spanning trees (extended abstract)
From MaRDI portal
Publication:826078
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(22)- NP-completeness and degree restricted spanning trees
- A note on matchings and spanning trees with bounded degrees
- Spanning tree with lower bound on the degrees
- Near-optimal bounded-degree spanning trees
- Complexity of some arc-partition problems for digraphs
- Spanning trees and spanning Eulerian subgraphs with small degrees
- Decomposing graphs into paths of fixed length
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- scientific article; zbMATH DE number 989714 (Why is no real title available?)
- Connectivity oracles for graphs subject to vertex failures
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
- Greedy routing via embedding graphs onto semi-metric spaces
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
- Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
- Computing and Combinatorics
- Spanning trees of bounded degree
- Reconfiguration of spanning trees with degree constraints or diameter constraints
- Edge‐decomposing graphs into coprime forests
- Approximating maximum-size properly colored forests
- Low-degree spanning trees of 2-edge-connected graphs in linear time
- Finding spanning trees with perfect matchings
- Approximating maximum-size properly colored forests
This page was built for publication: Bounded degree spanning trees (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826078)
