For a graph G, χ(G) will denote its chromatic number, and ω(G)
its cliqu...
A hole in a graph is an induced cycle of length at least 4. We give a si...
We prove that the cop number of a 2K_2-free graph is at most 2 if it has...
We adapt the Gyárfás path argument to prove that t-2 cops can
capture a ...
A class G of graphs is χ-bounded if there is a function f
such that for...