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)