An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)

DOI10.1016/j.jctb.2023.02.002zbMath1512.05137arXiv2206.14536MaRDI QIDQ6038583

Fengming Dong, Meiqiao Zhang

Publication date: 2 May 2023

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

chromatic polynomiallist-coloringlist-color functionbroken-cycle

Mathematics Subject Classification ID

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

Related Items (3)

DP color functions versus chromatic polynomials (II) ⋮ Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• When does the list-coloring function of a graph equal its chromatic polynomial
• The chromatic polynomial and list colorings
• Lower bounds on the number of triangles in a graph
• On the number of list‐colorings
• An introduction to chromatic polynomials
• Chromatic Polynomials

This page was built for publication: An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)