**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**31824

##### Complexity Analysis of Some Known Graph Coloring Instances

**Authors:**
Jeffrey L. Duffany

**Abstract:**

**Keywords:**
graph coloring,
complexity,
algorithm.

**Digital Object Identifier (DOI):**
doi.org/10.5281/zenodo.1074533

**References:**

[1] C.H. Papadimitrou and K. Steiglitz, "Combinatorial Optimization: Algorithms and Complexity", Dover, ISBN 0-486-40258-4, pp. 344.

[2] Duffany, J.L., "Statistical Characterization of NP-Complete Problems", Foundations of Computer Science Conference, World Computer Congress, Las Vegas, Nevada, July 14-17, 2008.

[3] Duffany, J.L. "Systems of Inequations", 4th LACCEI Conference, Mayaguez, PR, June 21-23, 2006.

[4] Duffany, J.L. "Generalized Decision Function and Gradient Search Technique for NP-Complete Problems", XXXII CLEI Conference, Santiago Chile, August 20-23, 2006.

[5] Duffany, J.L., "Optimal Solution of Constraint Satisfaction Problems", International Conference on Applied Computer Science, Sharm el Sheik, Egypt, January, 2009.

[6] Duffany, J.L., "Equivalence Class Subset Algorithm", International Conference Computer Information Technology, Tokyo, Japan, May, 2009.

[7] http://mat.gsia.cmu.edu/COLOR/instances.html

[8] http://www.r-project.org