Definitions from Wiktionary (Heawood conjecture)
▸ noun: (graph theory) A conjecture (proven in 1968) that gives a lower bound for the number of colors that are necessary for graph coloring on a surface of a given genus.
▸ Words similar to Heawood conjecture
▸ Usage examples for Heawood conjecture
▸ Idioms related to Heawood conjecture
▸ Wikipedia articles (New!)
▸ Words that often appear near Heawood conjecture
▸ Rhymes of Heawood conjecture
▸ Invented words related to Heawood conjecture
▸ noun: (graph theory) A conjecture (proven in 1968) that gives a lower bound for the number of colors that are necessary for graph coloring on a surface of a given genus.
Similar:
graph theory,
combinatorics,
mathematics,
analytic,
bialgebra,
biclustering,
bigraph,
chain rule,
closeness,
complete lattice,
more...
▸ Words similar to Heawood conjecture
▸ Usage examples for Heawood conjecture
▸ Idioms related to Heawood conjecture
▸ Wikipedia articles (New!)
▸ Words that often appear near Heawood conjecture
▸ Rhymes of Heawood conjecture
▸ Invented words related to Heawood conjecture