• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Sub-exponentially many 3-colorings of triangle-free planar graphs.

Arash AsadiZdenek DvorákLuke PostleRobin Thomas
Published in: J. Comb. Theory, Ser. B (2013)
Keyphrases
  • planar graphs
  • approximate inference
  • object boundaries
  • minimum weight