research
∙
04/06/2021
Coloring graph classes with no induced fork via perfect divisibility
For a graph G, χ(G) will denote its chromatic number, and ω(G) its cliqu...
share
research
∙
12/30/2019
Cop number of graphs without long holes
A hole in a graph is an induced cycle of length at least 4. We give a si...
research
∙
03/27/2019
Cop number of 2K_2-free graphs
We prove that the cop number of a 2K_2-free graph is at most 2 if it has...
research
∙
03/04/2019
An application of the Gyárfás path argument
We adapt the Gyárfás path argument to prove that t-2 cops can capture a ...
research
∙
09/12/2018
