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

page 1

page 2

page 3

page 4

research
03/22/2021

2-distance (Δ+1)-coloring of sparse graphs using the potential method

A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...
research
07/21/2020

Breaking the 2^n barrier for 5-coloring and 6-coloring

The coloring problem (i.e., computing the chromatic number of a graph) c...
research
12/08/2020

Packaging of Thick Membranes using a Multi-Spiral Folding Approach: Flat and Curved Surfaces

Elucidating versatile configurations of spiral folding, and investigatin...
research
10/23/2019

Parameterized Coloring Problems on Threshold Graphs

In this paper, we study several coloring problems on graphs from the vie...
research
01/26/2021

Automated decontamination of workspaces using UVC coupled with occupancy detection

Periodic disinfection of workspaces can reduce SARS-CoV-2 transmission. ...
research
12/30/2021

Weaving patterns inspired by the pentagon snub subdivision scheme

Various computer simulations regarding, e.g., the weather or structural ...
research
11/29/2022

AdsorbML: Accelerating Adsorption Energy Calculations with Machine Learning

Computational catalysis is playing an increasingly significant role in t...

Please sign up or login with your details

Forgot password? Click here to reset