Answers to two questions on the DP color function

DOI10.37236/9863zbMath1465.05066arXiv2009.08242OpenAlexW3164898278MaRDI QIDQ2030743

Seth Thomason, Jeffrey A. Mudrock

Publication date: 7 June 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.08242

zbMATH Keywords

chromatic polynomiallist coloringDP-coloring

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (7)

A deletion-contraction relation for the DP color function ⋮ The DP color function of joins and vertex-gluings of graphs ⋮ DP color functions versus chromatic polynomials (II) ⋮ DP‐coloring Cartesian products of graphs ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs ⋮ DP color functions versus chromatic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• When does the list-coloring function of a graph equal its chromatic polynomial
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• The chromatic polynomial and list colorings
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• DP-3-coloring of some planar graphs
• The list chromatic number of graphs with small clique number
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• A sufficient condition for DP-4-colorability
• A note on the DP-chromatic number of complete bipartite graphs
• The list chromatic index of a bipartite multigraph
• Asymptotically good list-colorings
• Combinatorial Nullstellensatz and DP-coloring of graphs
• Criticality, the list color function, and list coloring the Cartesian product of graphs
• On the chromatic polynomial and counting DP-colorings of graphs
• DP-colorings of graphs with high chromatic number
• The asymptotic behavior of the correspondence chromatic number
• On the number of list‐colorings
• Sharp Dirac's theorem for DP‐critical graphs
• The Johansson‐Molloy theorem for DP‐coloring
• A note on a Brooks' type theorem for DP‐coloring

This page was built for publication: Answers to two questions on the DP color function