Definitions from Wiktionary (Whitney's theorem)

▸ noun:  A theorem stating that two connected graphs are isomorphic if and only if their line graphs are isomorphic, with a single exception: K₃, the complete graph on three vertices, and the complete bipartite graph K_(1,3), which are not isomorphic but both have K₃ as their line graph.


▸ Words similar to Whitney's theorem
▸ Usage examples for Whitney's theorem

▸ Idioms related to Whitney's theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near Whitney's theorem
▸ Rhymes of Whitney's theorem

▸ Invented words related to Whitney's theorem