10 citations · 24 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2016★ 10 cited
Pathwidth and nonrepetitive list coloring
Adam Gągol, Gwenaël Joret, Jakub Kozik +1
A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence of colors as the second half. While every tree can be non…
math.CO2014★ 6 cited
Graph sharing game and the structure of weighted graphs with a forbidden subdivision
Adam Gągol, Piotr Micek, Bartosz Walczak
In the graph sharing game, two players share a connected graph with non-negative weights assigned to the vertices, claiming and collecting the vertices of one by one, while…