Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable.

Ming Chen Yingqian Wang Peipei Liu Jinghan Xu

Published in: Discret. Math. (2016)

Keyphrases

planar graphs
minimum weight
dynamic programming
belief networks
weighted graph
approximate inference