1302 search results - page 21 / 261 » On the Strong Chromatic Number |
142
click to vote
ENDM
2007
15 years 6 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
151
click to vote
JCT
2010
15 years 4 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 + ε...
158
click to vote
SIAMDM
2010
15 years 4 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...
150
click to vote
WALCOM
2010
IEEE
16 years 1 months ago
2010
IEEE
Given a simple graph G, a harmonious coloring of G is a proper vertex coloring such that each pair of colors appears together on at most one edge. The harmonious chromatic number i...
135
click to vote
AML
2005
15 years 6 months ago
2005
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...