On the number of list‐colorings

DOI10.1002/jgt.3190160307zbMath0754.05038OpenAlexW2001313216MaRDI QIDQ4013427

Quentin Donner

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1002/jgt.3190160307

zbMATH Keywords

chromatic polynomiallist-coloringslist of boxes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (15)

A deletion-contraction relation for the DP color function ⋮ When does the list-coloring function of a graph equal its chromatic polynomial ⋮ 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 ⋮ 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

Cites Work

• Unnamed Item

This page was built for publication: On the number of list‐colorings