Login / Signup

Gap one bounds for the equitable chromatic number of block graphs.

Janusz DybizbanskiHanna FurmanczykVahan Mkrtchyan
Published in: Discret. Appl. Math. (2024)
Keyphrases
  • computational complexity
  • upper bound
  • genetic algorithm
  • color images
  • maximum number
  • real time
  • social networks
  • memory requirements