73 citations · 178 across the 49 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
math.CO2015
Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
Maria Axenovich, Torsten Ueckerdt, Pascal Weiner
Recently, Borodin, Kostochka, and Yancey (On -improper -coloring of sparse graphs. Discrete Mathematics, 313(22), 2013) showed that the vertices of each planar graph of girth…
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…