When does the list-coloring function of a graph equal its chromatic polynomial
From MaRDI portal
Publication:345104
DOI10.1016/j.jctb.2016.08.002zbMath1350.05044OpenAlexW2516975892MaRDI QIDQ345104
Wei Wang, Zhidan Yan, Jian Guo Qian
Publication date: 25 November 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2016.08.002
Related Items (17)
A deletion-contraction relation for the DP color function ⋮ The DP color function of joins and vertex-gluings of graphs ⋮ An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) ⋮ DP color functions versus chromatic polynomials (II) ⋮ DP‐coloring Cartesian products of graphs ⋮ Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II ⋮ The list-coloring function of signed graphs ⋮ On the list color function threshold ⋮ Bounding the list color function threshold from above ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ A broken cycle theorem for the restrained chromatic function ⋮ Restraints permitting the largest number of colourings ⋮ Answers to two questions on the DP color function ⋮ List coloring a Cartesian product with a complete bipartite factor ⋮ DP color functions versus chromatic polynomials
Cites Work
This page was built for publication: When does the list-coloring function of a graph equal its chromatic polynomial
