A note on full orientability of a graph
Weifan Wang · Journal of Zhejiang Normal University · 2010
Full orientability of a simple graph G was discussed and proved that: if dman(G)≤6,then G would be fully orientable.The result was best possible in sense of there existed graphs G such that dmax(G)=7 and G was not fully orientable.