33 citations · 101 across the 16 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
Multigraphs without large bonds are wqo by contraction
Marcin Kamiński, Jean-Florent Raymond, Théophile Trunck
We show that the class of multigraphs with at most connected components and bonds of size at most is well-quasi-ordered by edge contraction for all positive integers .…