A note on orientation and chromatic number of graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0094-9
Abstract: Let D be any edge orientation of a graph G. We denote by $$\Delta _k(D)$$Δk(D) the maximum value t for which there exists a directed path $$v_1, \ldots , v_k$$v1,…,vk such that $$d^{out}(v_k)=t$$dout(vk)=t, where $$d^{out}(v_k)$$dout(vk)… read more here.
Keywords: orientation; orientation chromatic; number graphs; note orientation ... See more keywords