@inbook{1ef1ad7bf2b14f00b5a78a173f126097,
title = "On disjoint cycles",
abstract = "It is shown, that for each constant k ≥ 1, the following problems can be solved in O(n) time: given a graph G, determine whether G has k vertex disjoint cycles, determine whether G has k edge disjoint cycles, determine whether G has a feedback vertex set of size ≤ k. Also, every class G , that is closed under minor taking, or that is closed under immersion taking, and that does not contain the graph formed by taking the disjoint union of k copies of K_3, has an O (n) membership test algorithm.",
author = "Hans Bodlaender",
year = "1992",
doi = "10.1007/3-540-55121-2_24",
language = "English",
isbn = "978-3-540-55121-8",
volume = "570",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "230--238",
editor = "Gunther Schmidt and Rudolf Berghammer",
booktitle = "Graph-Theoretic Concepts in Computer Science",
note = "Workshop on Graph-Theoretic Concepts in Computer Science, WG 1991 ; Conference date: 06-07-1991 Through 06-07-1992",
}