An improved upper bound for the acyclic chromatic number of 1-planar graphs.

Wanshun Yang Weifan Wang Yiqiao Wang

Published in: Discret. Appl. Math. (2020)

Keyphrases

upper bound
lower bound
np hard
planar graphs
computational complexity
pairwise
worst case
higher order
em algorithm
np complete
bayesian framework