4298 search results - page 21 / 860 » Measurable chromatic numbers |
IPL
2008
14 years 11 months ago
2008
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�...
ENDM
2007
14 years 11 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3
JCT
2010
14 years 10 months ago
2010
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 + ε...
SIAMDM
2010
14 years 10 months ago
2010
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...
118
click to vote
IJCAI
1989
15 years 28 days ago
1989
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...