A degree condition for diameter two orientability of graphs
From MaRDI portal
Publication:1727780
DOI10.1016/j.disc.2018.12.012zbMath1405.05044arXiv1807.00032OpenAlexW2962798048WikidataQ128626215 ScholiaQ128626215MaRDI QIDQ1727780
Peter Dankelmann, Éva Czabarka, László A. Székely
Publication date: 20 February 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.00032
Related Items (4)
Oriented diameter of maximal outerplanar graphs ⋮ The oriented diameter of graphs with given connected domination number and distance domination number ⋮ Large girth and small oriented diameter graphs ⋮ Diameter three orientability of bipartite graphs
Cites Work
- Unnamed Item
- Improved bound on the oriented diameter of graphs with given minimum degree
- Oriented diameter of graphs with diameter 3
- Distances in orientations of graphs
- Orientations of digraphs almost preserving diameter
- AT-free graphs: Linear bounds for the oriented diameter
- Optimal orientations of graphs and digraphs: A survey
- The diameter of an orientation of a complete multipartite graph
- On optimal orientations of Cartesian products with a bipartite graph
- Diameter of orientations of graphs with given minimum degree
- The minimum diameter of orientations of complete multipartite graphs
- A size condition for diameter two orientable graphs
- Minimizing the Oriented Diameter of a Planar Graph
- Complexity of approximating the oriented diameter of chordal graphs
- Oriented diameter of graphs with given maximum degree
- Bounds for the minimum oriented diameter
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- On optimal orientations of Cartesian products of trees
This page was built for publication: A degree condition for diameter two orientability of graphs