|
[HCS11]
|
S. Held, W. Cook, E. Sewell (2011).
Safe lower bounds for graph coloring.
Integer Programming and Combinatoral Optimization, pp.
261-273.
[ bib ]
|
|
[DR07]
|
I. Dukanovic, F. Rendl (2007).
Semidefinite programming relaxations for graph coloring and
maximal clique problems.
Mathematical Programming, Serie B, vol. 109, no. 2-3, pp.
345-365.
[ bib |
DOI ]
|
|
[GL07b]
|
N. Gvozdenović, M. Laurent (2007).
The operator Ψ for the Chromatic Number of a Graph.
Optimization Online.
[ bib |
.html ]
|
|
[GL07a]
|
N. Gvozdenović, M. Laurent (2007).
Computing semidefinite programming lower bounds for the
(fractional) chromatic number via block-diagonalization.
Optimization Online.
[ bib |
.html ]
|