Heawood conjecture

专有名词

英文释义

专有名词
  1. 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.

词形变化

the Heawood conjecture canonical

词源

Formulated in 1890 by Percy John Heawood.
0 次浏览 数据来源: Wiktionary