Authors: Lozovanu Dmitrii, Vitaly Voloshin, Alex Zelikovsky
Abstract
The colorability problem on mixed hypergraphs is discussed. A criterion of colorability of mixed hypergraph with k colors is given.
D. Lozovanu, V. Voloshin, A. Zelikovsky,
Dumitru Lozovanu
Institute of Mathematics and Informatics,
Moldovan Academy of Sciences,
Academiei, 5, Chisinau, MD-2028,
Republic of Moldova
E-mail:
Vitaly Voloshin
Institute of Mathematics and Informatics,
Moldovan Academy of Sciences,
Academiei, 5, Chisinau, MD-2028,
Republic of Moldova
E-mail:
Alex Zelikovsky
Georgia State University, Atlanta
Department of Computer Science
E-mail:
Fulltext

–
0.13 Mb