%0 Journal Article
%A V. V. Lepin
%T A polynomial time algorithm for checking $2$-chromaticity for recursively constructed $k$-terminal hypergraphs
%J Trudy Instituta matematiki
%D 2006
%P 80-85
%V 14
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMB_2006_14_2_a9/
%G ru
%F TIMB_2006_14_2_a9