Assertion: graph | /r/HasAspect | a k-coloring
Facets:
Source sentences:
text: A graph has a k-coloring if and only if it has an acyclic orientation for which the longest path has length at most k; this is the Gallai–Hasse–Roy–Vitaver theorem (Nešetřil & Ossona de Mendez 2012).