@inproceedings { ,
title = {Independent transversals versus transversals},
abstract = {We compare the minimum size of a vertex cover, feedback vertex set and odd cycle transversal of a graph with the minimum size of the corresponding variants in which the transversal must be an independent set. We investigate for which graphs H the two sizes are equal whenever the graph in question belongs to the class of H-free graphs. We find complete classifications for vertex cover and almost complete classifications for feedback vertex set and odd cycle transversal.},
conference = {EuroComb 2019},
note = {EPrint Processing Status: DRO Team waiting for permission from publisher to deposit full text},
pages = {585-591},
publicationstatus = {Published},
volume = {88},
keyword = {Algorithms and Complexity in Durham (ACiD)},
year = {2019},
author = {Dabrowski, K.K. and Johnson, M. and Paesani, G. and Paulusma, D. and Zamaraev, V.}
}