Login / Signup

A (3, 1) ∗-choosable theorem on planar graphs.

Min ChenAndré RaspaudWeifan Wang
Published in: J. Comb. Optim. (2016)
Keyphrases
  • planar graphs
  • weighted graph
  • minimum weight
  • objective function
  • input image
  • binary images
  • connected components
  • partition function