Problems on chromatic polynomials of hypergraphs

DOI10.5614/ejgta.2020.8.2.4zbMath1468.05088OpenAlexW3094995925MaRDI QIDQ4957990

Ruixue Zhang, Fengming Dong

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2020.8.2.4

zbMATH Keywords

graphhypergraphchromatic polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic polynomials of some \((m,l)\)-hyperwheels
• Some properties of chromatic coefficients of linear uniform hypergraphs
• On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\)
• On chromaticity of hypergraphs
• Chromatic coefficients of linear uniform hypergraphs
• A broken-circuits-theorem for hypergraphs
• Two chromatic polynomial conjectures
• Proof of a chromatic polynomial conjecture
• Sunflower hypergraphs are chromatically unique
• Some results on chromatic polynomials of hypergraphs
• Broken-Cycle-Free Subgraphs and the Log-Concavity Conjecture for Chromatic Polynomials
• Expansions of Chromatic Polynomials and Log-Concavity
• The Markov chain of colourings
• Hypergraphs with pendant paths are not chromatically unique
• On chromatic number of graphs and set-systems
• An introduction to chromatic polynomials
• Chromatic polynomials of hypergraphs
• Chromatic polynomials of hypergraphs

This page was built for publication: Problems on chromatic polynomials of hypergraphs