Assertion: triangle's number | /r/CapableOf | color nonplanar triangle-free graphs
Facets:
Source sentences:
text: If a graph has chromatic number k, its Mycielskian has chromatic number k + 1, so this construction may be used to show that arbitrarily large numbers of colors may be needed to color nonplanar triangle-free graphs.