Assertion: connected graph | /r/HasProperty | isomorphic
Facets:
value: are with a single exception
type: OTHER
Source sentences:
text: The Whitney graph isomorphism theorem, shown by Hassler Whitney, states that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with a single exception: K 3 , the complete graph on three vertices, and the complete bipartite graph K 1,3 , which are not isomorphic but both have K 3 as their line graph.