par Golovach, Petr A.;Kaminski, Marcin ;Paulusma, Daniël;Thilikos Touloupas, Dimitrios
Référence Lecture notes in computer science, 5878 LNCS, page (514-523)
Publication Publié, 2009
Article révisé par les pairs
Résumé : An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in time when the input graph is planar. We also show that deciding if a graph has an induced packing of two odd cycles is NP-complete. © 2009 Springer-Verlag Berlin Heidelberg.