Options
Problems on chromatic polynomials of hypergraphs
Citation
Zhang, R., & Dong, F. (2020). Problems on chromatic polynomials of hypergraphs. Electronic Journal of Graph Theory and Applications, 8(2), 241–246. https://doi.org/10.5614/ejgta.2020.8.2.4
Abstract
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of chromatic polynomial of a hypergraph is a natural extension of chromatic polynomial of a graph. It also has been studied for more than 30 years. This short article will focus on introducing some important open problems on chromatic polynomials of hypergraphs.
Date Issued
2020
DOI
10.5614/ejgta.2020.8.2.4