%0 Journal Article
%A D. S. Malyshev
%T The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2014
%P 811-822
%V 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2014_11_a54/
%G en
%F SEMR_2014_11_a54