Pages that link to "Item:Q826078"
From MaRDI portal
The following pages link to Bounded degree spanning trees (extended abstract) (Q826078):
Displaying 16 items.
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree (Q345073) (← links)
- Greedy routing via embedding graphs onto semi-metric spaces (Q388089) (← links)
- NP-completeness and degree restricted spanning trees (Q1199472) (← links)
- A note on matchings and spanning trees with bounded degrees (Q1359373) (← links)
- Spanning tree with lower bound on the degrees (Q1744244) (← links)
- Near-optimal bounded-degree spanning trees (Q1840509) (← links)
- Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
- Spanning trees and spanning Eulerian subgraphs with small degrees (Q2342618) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (Q2957690) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios (Q5146820) (← links)
- Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces (Q5300503) (← links)
- Spanning trees of bounded degree (Q5947942) (← links)
- Reconfiguration of spanning trees with degree constraints or diameter constraints (Q6053473) (← links)
- Edge‐decomposing graphs into coprime forests (Q6055926) (← links)