Login / Signup
Every planar graph without triangles adjacent to cycles of length 3 or 6 is (1, 1, 1)-colorable.
Ziwen Huang
Published in:
Discret. Math. (2020)
Keyphrases
</>
planar graphs
dynamic programming
belief propagation