1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2016
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs
Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt
An ordered graph is a graph whose vertex set is a subset of integers. The edges are interpreted as tuples with . For a positive integer , a matrix $M \in \mat…
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…