On the number of list‐colorings

DOI10.1002/JGT.3190160307zbMATH Open0754.05038OpenAlexW2001313216MaRDI QIDQ4013427FDOQ4013427

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

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

zbMATH Keywords

chromatic polynomiallist-coloringslist of boxes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (29)

• Asymptotically the list colouring constants are 1
• The list-coloring function of signed 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
• Title not available (Why is that?)
• 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
• Non-chromatic-adherence of the DP color function via generalized theta graphs
• An Upper Bound for List T -Colourings
• An algebraic approach for counting DP-3-colorings of sparse graphs
• Title not available (Why is that?)
• When does the list-coloring function of a graph equal its chromatic polynomial
• 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
• The DP color function of joins and vertex-gluings of graphs
• The chromatic polynomial and list colorings
• The DP color function of clique-gluings 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)