@article{MAKHILLJEAS2019142118604,
    title = {On Chromatic Polynomial of Elementary h-Uniform Hyper Cycles},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {14},
    number = {21},
    pages = {7967-7971},
    year = {2019},
    issn = {1816-949x},
    doi = {jeasci.2019.7967.7971},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2019.7967.7971},
    author = {Abdul and},
    keywords = {hypercycle,polynomial,hygraph,graph colorings,h-uniform,chromatic,Graph theory},
    abstract = {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.}
    }