2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2019★ 2 cited
Defective Ramsey Numbers in Graph Classes
Yunus Emre Demirci, Tınaz Ekim, John Gimbel +1
Given a graph , a -sparse -set is a set of vertices inducing a subgraph with maximum degree at most . A -dense -set is a set of vertices that is -spars…
math.CO2019
Fractional cocoloring of graphs
John Gimbel, André Kündgen, Michael Molloy
The cochromatic number of a graph is the fewest number of colors needed to color the vertices of so that each color class is a clique or an independent set. In a fra…
math.CO2017
Obstacle Numbers of Planar Graphs
John Gimbel, Patrice Ossona de Mendez, Pavel Valtr
Given finitely many connected polygonal obstacles in the plane and a set of points in general position and not in any obstacle, the {\em visibility graph} of $P…