Academic Journal

Problems on chromatic polynomials of hypergraphs

Bibliographic Details
Title: Problems on chromatic polynomials of hypergraphs
Authors: Ruixue Zhang, Fengming Dong
Superior Title: Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 241-246 (2020)
Publisher Information: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2020.
Publication Year: 2020
Collection: LCC:Mathematics
Subject Terms: graph, hypergraph, chromatic polynomial, Mathematics, QA1-939
Description: 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 prblems on chromatic polynomials of hypergraphs.
Document Type: article
File Description: electronic resource
Language: English
ISSN: 2338-2287
Relation: https://www.ejgta.org/index.php/ejgta/article/view/1050; https://doaj.org/toc/2338-2287
DOI: 10.5614/ejgta.2020.8.2.4
Access URL: https://doaj.org/article/d904405e5023416598aca13fc9172cd8
Accession Number: edsdoj.904405e5023416598aca13fc9172cd8
Database: Directory of Open Access Journals
Description
Description not available.