Definitions from Wikipedia (Grinberg's theorem)

▸ noun:  In graph theory, Grinberg's theorem is a necessary condition for a planar graph to contain a Hamiltonian cycle, based on the lengths of its face cycles.


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

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

▸ Invented words related to grinberg's theorem