Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph...
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε...
Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at...
It is well known that chromatic information can assist in solving the stereo correspondence problem. It has also been suggested that there are two independent first-order stereop...
John R. Jordan III, Alan C. Bovik, Wilson S. Geisl...