Login / Signup

Bounds for the b-chromatic number of some families of graphs.

Mekkia KouiderManouchehr Zaker
Published in: Discret. Math. (2006)
Keyphrases
  • small number
  • computational complexity
  • lower bound
  • image processing
  • website
  • optimal solution
  • graph matching
  • graph theory
  • fixed number