Ruixue Zhang
Mathematics and Mathematics Education National Institute of Education Nanyang Technological University, Singapore 637616

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Problems on chromatic polynomials of hypergraphs Ruixue Zhang; Fengming Dong
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 8, No 2 (2020): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 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 prblems on chromatic polynomials of hypergraphs.