Assertion: graph's vertex | /r/CapableOf | join by edge
Facets:
Source sentences:
text: In an equivalent graph-theoretic form, one may translate this problem to ask whether the vertices of a planar graph can always be coloured by using just four colours in such a way that vertices joined by an edge have different colours.