
Coloring graph classes with no induced fork via perfect divisibility
For a graph G, χ(G) will denote its chromatic number, and ω(G) its cliqu...
read it

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...
read it

Cop number of 2K_2free graphs
We prove that the cop number of a 2K_2free graph is at most 2 if it has...
read it

An application of the Gyárfás path argument
We adapt the Gyárfás path argument to prove that t2 cops can capture a ...
read it

Classes of graphs with no long cycle as a vertexminor are polynomially χbounded
A class G of graphs is χbounded if there is a function f such that for...
read it
Vaidy Sivaraman
is this you? claim profile