Some new hereditary classes where graph coloring remains NP-hard

David Schindl. Some new hereditary classes where graph coloring remains NP-hard. Discrete Mathematics, 295(1-3):197-202, 2005. [doi]

Abstract

Abstract is missing.