The oriented diameter of a bridgeless graph with given P₃
From MaRDI portal
Publication:6188296
Recommendations
Cites work
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- AT-free graphs: Linear bounds for the oriented diameter
- Bounds for the minimum oriented diameter
- Diameter of orientations of graphs with given minimum degree
- Digraphs
- Distances in orientations of graphs
- scientific article; zbMATH DE number 3991530 (Why is no real title available?)
- scientific article; zbMATH DE number 3257169 (Why is no real title available?)
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- On the optimal strongly connected orientations of city street graphs. II: Two east-west avenues or North—South Streets
- On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets
- On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets
- Optimal orientations of graphs and digraphs: A survey
- Orientation of 2-edge-connected graphs with diameter 3
- Oriented diameter of graphs with diameter 3
- Oriented diameter of graphs with given maximum degree
- Strongly connected orientations of mixed multigraphs
Cited in
(1)
This page was built for publication: The oriented diameter of a bridgeless graph with given \(P_3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188296)
