In 2019, Czabarka, Dankelmann and Székely showed that for every undirected graph of order $n$, the minimum degree threshold for diameter two orientability is $\frac{n}{2}+ \Theta(\ln n)$. In this paper, we consider bipartite graphs and give a sufficient condition in terms of the minimum degree for such graphs to have oriented diameter three. We in particular prove that for balanced bipartite graphs of order $n$, the minimum degree threshold for diameter three orientability is $\frac{n}{4}+\Theta(\ln n)$.
@article{10_37236_9723,
author = {Bin Chen and An Chang},
title = {Diameter three orientability of bipartite graphs},
journal = {The electronic journal of combinatorics},
year = {2021},
volume = {28},
number = {2},
doi = {10.37236/9723},
zbl = {1465.05030},
url = {http://geodesic.mathdoc.fr/articles/10.37236/9723/}
}
TY - JOUR
AU - Bin Chen
AU - An Chang
TI - Diameter three orientability of bipartite graphs
JO - The electronic journal of combinatorics
PY - 2021
VL - 28
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/9723/
DO - 10.37236/9723
ID - 10_37236_9723
ER -
%0 Journal Article
%A Bin Chen
%A An Chang
%T Diameter three orientability of bipartite graphs
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/9723/
%R 10.37236/9723
%F 10_37236_9723
Bin Chen; An Chang. Diameter three orientability of bipartite graphs. The electronic journal of combinatorics, Tome 28 (2021) no. 2. doi: 10.37236/9723
