The following pages link to Decreasing the diameter of cycles (Q4422616):
Displaying 9 items.
- On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Revisiting cycle shrinking (Q1195153) (← links)
- How to decrease the diameter of triangle-free graphs (Q1307443) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- Diameter increase caused by edge deletion (Q3789599) (← links)
- Decreasing the diameter of bounded degree graphs (Q4521485) (← links)
- (Q5369529) (← links)