Login / Signup

Upper bounds on adjacent vertex distinguishing total chromatic number of graphs.

Xiaolan HuYunqing ZhangZhengke Miao
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • upper bound
  • small number
  • computational complexity
  • color images
  • undirected graph
  • multi class
  • sample size