Login / Signup

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8.

Zdenek DvorákLuke Postle
Published in: J. Comb. Theory, Ser. B (2018)
Keyphrases
  • planar graphs
  • least squares
  • linear programming
  • probability distribution
  • higher order
  • markov random field
  • binary images
  • image matching