On the hardness of 4-coloring a 3-colorable graph

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2000, Pages 188-197

  Guruswami, Venkatesan ^a   Khanna, Sanjeev ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; THEOREM PROVING;

GREEDY ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0033700249     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)