Pages that link to "Item:Q1307443"
From MaRDI portal
The following pages link to How to decrease the diameter of triangle-free graphs (Q1307443):
Displaying 16 items.
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs (Q967381) (← links)
- Vertex fusion under distance constraints (Q1039434) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
- Augmenting outerplanar graphs to meet diameter requirements (Q2862552) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- Vertex fusion under diameter constraints (Q3503481) (← links)
- Decreasing the diameter of cycles (Q4422616) (← links)
- Decreasing the diameter of bounded degree graphs (Q4521485) (← links)
- Decompositions into Subgraphs of Small Diameter (Q4911111) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)