On the oriented chromatic number of grid
✍
Guillaume Fertin; André Raspaud; Arup Roychowdhury
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 111 KB
In this paper, we focus on the oriented coloring of graphs. Oriented coloring is a coloring of the vertices of an oriented graph G without symmetric arcs such that (i) no two neighbors in G are assigned the same color, and (ii) if two vertices u and v such that (u, v) ∈ A(G) are assigned colors c(u)