Login / Signup

On bounding the chromatic number of L-graphs.

Sean McGuinness
Published in: Discret. Math. (1996)
Keyphrases
  • computational complexity
  • image processing
  • color images
  • small number
  • maximum number
  • real world
  • graph theory
  • finite number
  • random graphs