On the number of list‐colorings

DOI10.1002/JGT.3190160307MaRDI QIDQ4013427zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The chromatic polynomial and list colorings
• When does the list-coloring function of a graph equal its chromatic polynomial
• scientific article; zbMATH DE number 1789917
• Generalized list colourings of graphs
• List coloring of Cartesian products of graphs

Cited in

(36)

• Asymptotically the list colouring constants are 1
• The list-coloring function of signed graphs
• Parameterized complexity of coupon coloring of graphs
• DP‐coloring Cartesian products of graphs
• On the list color function threshold
• DP color functions versus chromatic polynomials (II)
• Bounding the list color function threshold from above
• An improved lower bound of P(G,L)-P(G,k) for k-assignments L
• On neighbour-distinguishing colourings from lists
• List coloring of matroids and base exchange properties
• scientific article; zbMATH DE number 6518587 (Why is no real title available?)
• Answers to two questions on the DP color function
• A deletion-contraction relation for the DP color function
• On the chromatic polynomial and counting DP-colorings of graphs
• Nonrepetitive list colorings of the integers
• Approximating List-Coloring on a Fixed Surface
• List coloring the Cartesian product of a complete graph and complete bipartite graph
• Non-chromatic-adherence of the DP color function via generalized theta graphs
• List coloring and n-monophilic graphs.
• When does the list-coloring function of a graph equal its chromatic polynomial
• An Upper Bound for List T -Colourings
• On polynomial representations of dual DP color functions
• An algebraic approach for counting DP-3-colorings of sparse graphs
• scientific article; zbMATH DE number 1553748 (Why is no real title available?)
• A broken cycle theorem for the restrained chromatic function
• On the problem of Erdős and Hajnal in the case of list colorings
• On the list coloring version of Reed's conjecture
• List colouring of graphs and generalized Dyck paths
• The DP color function of joins and vertex-gluings of graphs
• The chromatic polynomial and list colorings
• On the DP-chromatic number of Cartesian products of critical graphs
• The DP color function of clique-gluings of graphs
• Counting packings of list-colorings of graphs
• Restraints permitting the largest number of colourings
• A Hajós-like theorem for list coloring
• List colorings and reducibility

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013427)