Authors : Abdul Jalil M. Khalaf and Mahdi Gareep Sabbar
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.
Abdul Jalil M. Khalaf and Mahdi Gareep Sabbar, 2019. On Chromatic Polynomial of Elementary h-Uniform Hyper Cycles. Journal of Engineering and Applied Sciences, 14: 7967-7971.