When does the list-coloring function of a graph equal its chromatic polynomial

DOI10.1016/J.JCTB.2016.08.002zbMATH Open1350.05044OpenAlexW2516975892MaRDI QIDQ345104FDOQ345104

Authors: Wei Wang, Zhidan Yan, Jianguo 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

Recommendations

• The chromatic polynomial and list colorings
• Colorings versus list colorings of uniform hypergraphs
• On the number of list‐colorings
• scientific article; zbMATH DE number 1789917
• On the chromatic polynomial and counting DP-colorings of graphs

zbMATH Keywords

list coloringchromatic polynomialbroken cycle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The chromatic polynomial and list colorings
• On the number of list‐colorings
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• 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\)
• Answers to two questions on the DP color function
• DP color functions versus chromatic polynomials
• On the number of list‐colorings
• A deletion-contraction relation for the DP color function
• On the chromatic polynomial and counting DP-colorings of graphs
• Non-chromatic-adherence of the DP color function via generalized theta graphs
• Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II
• An algebraic approach for counting DP-3-colorings of sparse graphs
• A broken cycle theorem for the restrained chromatic function
• List coloring a Cartesian product with a complete bipartite factor
• 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

This page was built for publication: When does the list-coloring function of a graph equal its chromatic polynomial

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