Login / Signup

Equitable coloring of corona products of cubic graphs is harder than ordinary coloring.

Hanna FurmanczykMarek Kubale
Published in: Ars Math. Contemp. (2016)
Keyphrases
  • np hard
  • graph theory
  • multiagent evolutionary algorithm
  • genetic algorithm
  • case study
  • data structure
  • multi objective
  • graph structure
  • complex structures
  • graph representation
  • graph theoretic