TY  - JOUR
T1  - On Chromatic Polynomial of Elementary h-Uniform Hyper Cycles
AU - Jalil M. Khalaf, Abdul AU - Gareep Sabbar, Mahdi 
JO  - Journal of Engineering and Applied Sciences
VL  - 14
IS  - 21
SP  - 7967
EP  - 7971
PY  - 2019
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2019.7967.7971
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2019.7967.7971
KW  - hypercycle
KW  -polynomial
KW  -hygraph
KW  -graph colorings
KW  -h-uniform
KW  -chromatic
KW  -Graph theory
AB  - One of the most popular and useful areas of graph theory is graph colorings. Frequently, we are
concerned with determining the least number of colors with which we can achieve a proper coloring on a
hypergraph. Furthermore, we want to count the possible number of different proper colorings on a hygraph with
a given number of colors which is called the chromatic polynomial.
ER  -