Q6188296 (Q6188296): Difference between revisions

@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Graphs, with an Application to a Problem of Traffic Control
+Normal rank
@@ Property / cites work @@
+On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
+Normal rank
@@ Property / cites work @@
+On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
+Normal rank
@@ Property / cites work @@
+On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
+Normal rank
@@ Property / cites work @@
+On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
+Normal rank
@@ Property / cites work @@
+Distances in orientations of graphs
@@ Property / cites work: Distances in orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3754020
@@ Property / cites work: Q3754020 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5457252
@@ Property / cites work: Q5457252 / rank @@
+Normal rank
@@ Property / cites work @@
+Oriented diameter of graphs with diameter 3
@@ Property / cites work: Oriented diameter of graphs with diameter 3 / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly connected orientations of mixed multigraphs
+Normal rank
@@ Property / cites work @@
+AT-free graphs: Linear bounds for the oriented diameter
+Normal rank
@@ Property / cites work @@
+Bounds for the minimum oriented diameter
@@ Property / cites work: Bounds for the minimum oriented diameter / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter of orientations of graphs with given minimum degree
+Normal rank
@@ Property / cites work @@
+Optimal orientations of graphs and digraphs: A survey
+Normal rank
@@ Property / cites work @@
+Q5545297
@@ Property / cites work: Q5545297 / rank @@
+Normal rank
@@ Property / cites work @@
+Oriented diameter of graphs with given maximum degree
+Normal rank