Sciweavers

1302 search results - page 4 / 261
» On the Strong Chromatic Number
Sort
View
APPML
2011
14 years 4 months ago
The fractional chromatic number of Zykov products of graphs
Zykov designed one of the oldest known family of triangle-free graphs with arbitrarily high chromatic number. We determine the fractional chromatic number of the Zykov product of ...
Pierre Charbit, Jean-Sébastien Sereni
ICANNGA
2007
Springer
141views Algorithms» more  ICANNGA 2007»
15 years 3 months ago
On Sum Coloring of Graphs with Parallel Genetic Algorithms
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...
Zbigniew Kokosinski, Krzysztof Kwarciany
MP
2010
149views more  MP 2010»
14 years 8 months ago
Copositive programming motivated bounds on the stability and the chromatic numbers
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
Igor Dukanovic, Franz Rendl
JSYML
2008
100views more  JSYML 2008»
14 years 9 months ago
Measurable chromatic numbers
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
Benjamin D. Miller
APPROX
2004
Springer
125views Algorithms» more  APPROX 2004»
15 years 2 months ago
Strong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
Amin Coja-Oghlan, Andreas Goerdt, André Lan...