A note on the colorability of mixed hypergraph using k colors

The colorability problem on mixed hypergraphs is discussed. A criterion of colorability of mixed hypergraph with k colors is given.

Bibliographic Details
Main Authors:	Dumitru Lozovanu, Vitaly Voloshin, Alex Zelikovsky
Format:	Article
Language:	English
Published:	Vladimir Andrunachievici Institute of Mathematics and Computer Science 2002-01-01
Series:	Computer Science Journal of Moldova
Online Access:	http://www.math.md/nrofdownloads.php?file=/files/csjm/v10-n1/v10-n1-(pp92-95).pdf

Internet