Login / Signup
Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.
Lili Song
Lei Sun
Published in:
Ars Comb. (2017)
Keyphrases
</>
planar graphs
minimum weight
approximate inference
undirected graph
probabilistic model
weighted graph