1 citations · 1 across the 9 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
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…
math.CO2014
Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs
Maria Axenovich, Jonathan Rollin
A vertex-coloring of a hypergraph is conflict-free, if each edge contains a vertex whose color is not repeated on any other vertex of that edge. Let be the smallest integ…