Assertion: planar graph | /r/HasProperty | obtained via clique cover construction
Facets:
Source sentences:
text: For instance, a well-covered 3-connected maximal planar graph may be obtained via the clique cover construction from any 3t-vertex maximal planar graph in which there are t disjoint triangle faces by adding t new vertices, one within each of these faces.