Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A note on the colorability of mixed hypergraph using k colors
Authors: Lozovanu Dmitrii, Vitaly Voloshin, Alex Zelikovsky
– 0.13 Mb
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:
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
Contents
- Personal Reflections on a Joyful Occasion
- Fuzzy Sets-based Control Rules for Terminating Algorithms
- Evolutionary Design of Very Compact Analog Circuit Implementations of Fuzzy Systems
- Perceived Fuzzy Subsets of Finite Sets
- The digital technologies as the chance for sustainable development of Moldova
- Analytical space for data representation and interactive analysis
- On the upper chromatic index of a multigraph
- A note on the colorability of mixed hypergraph using k colors
