3 search results - page 1 / 1 » On directed local chromatic number, shift graphs, and Borsuk... |
74
Voted
JGT
2011
14 years 5 months ago
2011
JCO
2007
14 years 10 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
PODC
2006
ACM
15 years 4 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...