751 search results - page 22 / 151 » The Distinguishing Chromatic Number |
EJC
2006
13 years 11 months ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
IPL
2008
13 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
13 years 10 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
13 years 9 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
13 years 9 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...