Diameter three orientability of mixed bipartite graphs
From MaRDI portal
Cites work
- A degree condition for diameter two orientability of graphs
- 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
- Diameter three orientability of bipartite graphs
- Distances in orientations of graphs
- Graph theory
- scientific article; zbMATH DE number 4204370 (Why is no real title available?)
- scientific article; zbMATH DE number 3991541 (Why is no real title available?)
- Improved bound on the oriented diameter of graphs with given minimum degree
- Improved bounds for the oriented radius of mixed multigraphs
- Large girth and small oriented diameter graphs
- On the oriented diameter of planar triangulations
- Optimal oriented diameter of graphs with diameter 3
- Oriented diameter and rainbow connection number of a graph
- Oriented diameter of graphs with diameter 3
- Oriented diameter of graphs with given girth and maximum degree
- Oriented diameter of graphs with given maximum degree
- Oriented diameter of maximal outerplanar graphs
- Oriented diameter of star graphs
- Strongly connected orientations of mixed multigraphs
- The oriented diameter of graphs with given connected domination number and distance domination number
This page was built for publication: Diameter three orientability of mixed bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6936992)