TY  - JOUR
AU  - D. S. Malyshev
TI  - The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2014
SP  - 811
EP  - 822
VL  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2014_11_a54/
LA  - en
ID  - SEMR_2014_11_a54
ER  -