Problems on chromatic polynomials of hypergraphs
| Main Authors: | Zhang, Ruixue; Mathematics and Mathematics Education National Institute of Education Nanyang Technological University, Singapore 637616, Dong, Fengming; Mathematics and Mathematics Education National Institute of Education Nanyang Technological University, Singapore 637616 |
|---|---|
| Format: | Article info application/pdf eJournal |
| Bahasa: | eng |
| Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2020
|
| Subjects: | |
| Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/1050 https://www.ejgta.org/index.php/ejgta/article/view/1050/pdf_139 |
Daftar Isi:
- 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.