On decidability of hyperbolicity

10/04/2020 ∙ by Zdeněk Dvořák, et al. ∙ 0

We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.