266 search results - page 40 / 54 » Chromatic Ramsey numbers |
DAM
2002
14 years 11 months ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
DM
2006
14 years 11 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
104
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
146
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...