Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II

DOI10.1016/j.disc.2023.113701zbMath1525.05058arXiv2302.05067MaRDI QIDQ6080166

Meiqiao Zhang, Fengming Dong

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.05067

zbMATH Keywords

hypergraphchromatic polynomiallist-coloringlist-color function

Mathematics Subject Classification ID

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

Cites Work

• When does the list-coloring function of a graph equal its chromatic polynomial
• Some properties of chromatic coefficients of linear uniform hypergraphs
• The chromatic polynomial and list colorings
• Chromatic coefficients of linear uniform hypergraphs
• Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
• A note on a broken-cycle theorem for hypergraphs
• Colorings versus list colorings of uniform hypergraphs
• An introduction to chromatic polynomials
• An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II