Sign in

A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13.

Jingjing HuoWeifan WangYiqiao Wang
Published in: Discret. Math. (2018)
Keyphrases
  • planar graphs
  • maximum likelihood
  • pairwise
  • message passing