Login / Signup
Planar graphs without adjacent cycles of length at most seven are 3-colorable.
Oleg V. Borodin
Mickaël Montassier
André Raspaud
Published in:
Discret. Math. (2010)
Keyphrases
</>
planar graphs
minimum weight
bipartite graph
approximate inference