|
|
|
|
|
Frank Gurski, Dominique Komander and Carolin Rehs
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph ??=(??,...
ver más
|
|
|
|
|