Login / Signup
Every signed planar graph without cycles of length from 4 to 8 is 3-colorable.
Lili Hu
Xiangwen Li
Published in:
Discret. Math. (2018)
Keyphrases
</>
planar graphs
weighted graph
belief propagation
minimum weight