J. Petr

activity

20192023

most citedThe odd chromatic number of a planar graph is at most 8

22 citations · 31 across the 7 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021★ 7 cited

A faster algorithm for Cops and Robbers

Jan Petr, Julien Portier, Leo Versteegen

We present an algorithm of time complexity $O (k n^{k + 2})$ deciding whether a graph $G$ on $n$ vertices is $k$ -copwin. The fastest algorithm thus far had time complexity $O(n^{2k+2})…

math.CO2021★ 1 cited

A new lower bound on the pebbling number of the grid

Jan Petr, Julien Portier, Szymon Stolarczyk

A pebbling move on a graph consists of removing $2$ pebbles from a vertex and adding $1$ pebble to one of the neighbouring vertices. A vertex is called reachable if we can put $1$ …