RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.10, n.1 (28), 2002/

A note on the colorability of mixed hypergraph using k colors

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

Adobe PDF document0.13 Mb