DP color functions versus chromatic polynomials (II)

DOI10.1002/jgt.22944zbMath1522.05149arXiv2203.07704OpenAlexW4225488471MaRDI QIDQ6047960

Fengming Dong, Meiqiao Zhang

Publication date: 10 October 2023

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

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

zbMATH Keywords

spanning treechromatic polynomialDP-coloringDP color function

Mathematics Subject Classification ID

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

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
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• The chromatic polynomial and list colorings
• Answers to two questions on the DP color function
• DP color functions versus chromatic polynomials
• On the chromatic polynomial and counting DP-colorings of graphs
• On the number of list‐colorings
• Handbook of the Tutte Polynomial and Related Topics
• An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)

This page was built for publication: DP color functions versus chromatic polynomials (II)