C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Sub-exponentially many 3-colorings of triangle-free planar graphs.
Arash Asadi
Zdenek Dvorák
Luke Postle
Robin Thomas
Published in:
J. Comb. Theory, Ser. B (2013)
Keyphrases
</>
planar graphs
approximate inference
object boundaries
minimum weight