Augmenting Outerplanar Graphs to Meet Diameter Requirements (Q2862552): Difference between revisions

@@ Property / cites work @@
+Decreasing the diameter of bounded degree graphs
@@ Property / cites work: Decreasing the diameter of bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximability and non-approximability results for graph diameter decreasing problems
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Dually Chordal Graphs
@@ Property / cites work: Dually Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed covering of trees and the augmentation problem with odd diameter constraints
+Normal rank
@@ Property / cites work @@
+Augmenting trees to meet biconnectivity and diameter constraints
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+How to decrease the diameter of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Q4448760
@@ Property / cites work: Q4448760 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting forests to meet odd diameter requirements
+Normal rank
@@ Property / cites work @@
+On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Diameter increase caused by edge deletion
@@ Property / cites work: Diameter increase caused by edge deletion / rank @@
+Normal rank