Login / Signup
A (3, 1) ∗-choosable theorem on planar graphs.
Min Chen
André Raspaud
Weifan Wang
Published in:
J. Comb. Optim. (2016)
Keyphrases
</>
planar graphs
weighted graph
minimum weight
objective function
input image
binary images
connected components
partition function