Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Colouring -Free Graphs
Tereza Klimošová, Josef Malík, Tomáš Masařík +3
The -Colouring problem is to decide if the vertices of a graph can be coloured with at most colours for a fixed integer such that no two adjacent vertices are coloured a…
cs.CC2018
ARRIVAL: Next Stop in CLS
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubáček +3
We study the computational complexity of ARRIVAL, a zero-player game on -vertex switch graphs introduced by Dohrau, Gärtner, Kohler, Matoušek, and Welzl. They showed that the pr…