Assertion: planar graph | /r/HasProperty | represented as a collection of circles
Facets:
value: alternatively
type: DEGREE
value: by the circle
type: OTHER
Source sentences:
text: Alternatively, by the circle packing theorem, any planar graph may be represented as a collection of circles, any two of which cross if and only if the corresponding vertices are adjacent; these circles (with a starting and ending point chosen to turn them into open curves) provide a string graph representation of the given planar graph.