Problem: Colourability

Definition:
Input: A graph G in this class and an integer k.
Output: True iff each vertex of G can be assigned one colour out of k such that whenever two vertices are adjacent, they have different colours.

Linear

back to top

Polynomial

back to top

GI-complete

back to top

NP-hard

back to top

NP-complete

back to top

coNP-complete

back to top

Open

back to top

Unknown to ISGCI

back to top

AltStyle によって変換されたページ (->オリジナル) /