30 citations · 157 across the 83 of their papers we have counts for
Showing 2014 · math.COShow all
2 papers · 2 filters
math.CO2014
The Parameterized Complexity of Graph Cyclability
Petr A. Golovach, Marcin Kamiński, Spyridon Maniatis +1
The cyclability of a graph is the maximum integer for which every vertices lie on a cycle. The algorithmic version of the problem, given a graph and a non-negative inte…
math.CO2014
Contraction Obstructions for Connected Graph Searching
Micah J. Best, Arvind Gupta, Dimitrios M. Thilikos +1
We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded conne…