KnowraGraph coloringLinked fromLinked fromThe 30 pages that link to Graph coloring, each with the reason it gives.All 30Broader topic 2Related 18Narrower topic 9Compared with 1NP-completenessBroader topic: Deciding whether a graph can be colored with three colors is NP-complete.Courcelle's theoremBroader topic: For fixed numbers of colors, existence of a proper coloring is expressible in the theorem's logic.