26 search results - page 1 / 6 » The t-Improper Chromatic Number of Random Graphs |
71
Voted
CPC
2010
15 years 1 months ago
2010
138
Voted
RSA
2008
15 years 18 days ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
159
Voted
ENDM
2000
15 years 29 days ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
106
Voted
FCT
2009
Springer
15 years 7 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
85
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
Given d (0, ) let kd be the smallest integer k such that d < 2k log k. We prove that the chromatic number of a random graph G(n, d/n) is either kd or kd + 1 almost surely.