Minimizing the Oriented Diameter of a Planar Graph (Q2851475): Difference between revisions

@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Distances in orientations of graphs
@@ Property / cites work: Distances in orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensional Parameters and Local Treewidth
@@ Property / cites work: Bidimensional Parameters and Local Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank