Login / Signup

Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable.

Oleg V. BorodinAlexei N. GlebovMickaël MontassierAndré Raspaud
Published in: J. Comb. Theory, Ser. B (2009)
Keyphrases
  • planar graphs
  • minimum weight
  • approximate inference
  • point sets
  • boundary points