%0 Journal Article
%A Kratochvíl, Jan
%A Schiermeyer, Ingo
%T On the computational complexity of (O,P)-partition problems
%J Discussiones Mathematicae. Graph Theory
%D 1997
%P 253-258
%V 17
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1997_17_2_a3/
%G en
%F DMGT_1997_17_2_a3