![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Culberson J. Gent I.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.265, Iss.1, 2001-08, pp. : 227-264
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Facets of the Graph Coloring Polytope
By Coll P.
Annals of Operations Research, Vol. 116, Iss. 1-4, 2002-10 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A Range-Compaction Heuristic for Graph Coloring
By Di Blas Andrea Jagota Arun Hughey Richard
Journal of Heuristics, Vol. 9, Iss. 6, 2003-12 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Combinatorial algorithms for distributed graph coloring
By Barenboim Leonid Elkin Michael
Distributed Computing, Vol. 27, Iss. 2, 2014-04 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)