Assertion: complete bipartite graph | /r/HasProperty | k 2,4
Facets:
Source sentences:
text: For some planar graphs that are not 3-vertex-connected, such as the complete bipartite graph K 2,4 , the embedding is not unique, but all embeddings are isomorphic.