1 citations · 2 across the 5 of their papers we have counts for
8 papers
Coloring graph classes with no induced fork via perfect divisibility
T. Karthick, Jenny Kaufmann, Vaidy Sivaraman
For a graph , will denote its chromatic number, and its clique number. A graph is said to be perfectly divisible if for all induced subgraphs of , $V(H)…
The family of bicircular matroids closed under duality
Vaidy Sivaraman, Daniel Slilaty
We characterize the 3-connected members of the intersection of the class of bicircular and cobicircular matroids. Aside from some exceptional matroids with rank and corank at most…
Cop number of graphs without long holes
Vaidy Sivaraman
A hole in a graph is an induced cycle of length at least 4. We give a simple winning strategy for t-3 cops to capture a robber in the game of cops and robbers played in a graph tha…
Cop number of -free graphs
Vaidy Sivaraman, Stephen Testa
We prove that the cop number of a -free graph is at most if it has diameter or does not have an induced cycle of length , where . We conjecture…
An application of the Gyárfás path argument
Vaidy Sivaraman
We adapt the Gyárfás path argument to prove that cops can capture a robber, in at most moves, in the game of cops and robbers played in a graph that does not contain th…
Classes of graphs with no long cycle as a vertex-minor are polynomially -bounded
Ringi Kim, O-joung Kwon, Sang-il Oum +1
A class of graphs is -bounded if there is a function such that for every graph and every induced subgraph of , . In ad…