617 search results - page 6 / 124 » On the Chromatic Number of Random Graphs |
DAM
2007
14 years 11 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
101
click to vote
CPC
2007
14 years 11 months ago
2007
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
75
Voted
ICANNGA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
68
Voted
RSA
1998
14 years 11 months ago
1998
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
ENDM
2010
14 years 11 months ago
2010
A main result of combinatorial optimization is that clique and chromatic number of a perfect graph are computable in polynomial time (Gr