Assertion: graph | /r/HasProperty | colored
Facets:
Source sentences:
text: The chromatic polynomial counts the number of ways a graph can be colored using no more than a given number of colors.
text: Determining if a graph can be colored with 2 colors is equivalent to determining whether or not the graph is bipartite, and thus computable in linear time using breadth-first search or depth-first search.