Login / Signup

Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable.

Oleg V. BorodinAlexei N. GlebovAndré Raspaud
Published in: Discret. Math. (2010)
Keyphrases
  • planar graphs
  • approximate inference
  • minimum weight
  • higher order