Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable.

Heather Hoskins Runrun Liu Jennifer Vandenbussche Gexin Yu

Published in: J. Comb. Optim. (2018)

Keyphrases

planar graphs
semi supervised
approximate inference
markov random field
closed form
weighted graph