6 citations · 7 across the 3 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2015★ 1 cited
Conditions on Ramsey non-equivalence
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramse…
math.CO2014
Playing weighted Tron on Trees
Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt +1
We consider the weighted version of the Tron game on graphs where two players, Alice and Bob, each build their own path by claiming one vertex at a time, starting with Alice. The v…