Login / Signup

A lower bound on the chromatic number of Mycielski graphs.

Massimiliano CaramiaPaolo Dell'Olmo
Published in: Discret. Math. (2001)
Keyphrases
  • lower bound
  • small number
  • fixed number
  • undirected graph
  • neural network
  • spanning tree
  • maximum number
  • sufficiently accurate