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

Owen Hill Diana Smith Yingqian Wang Lingji Xu Gexin Yu

Published in: Discret. Math. (2013)

Keyphrases

planar graphs
minimum weight
bipartite graph
approximate inference
graph structure
weighted graph