The DP color function of joins and vertex-gluings of graphs

DOI10.1016/j.disc.2022.113093zbMath1495.05082arXiv2104.12268OpenAlexW3159785683WikidataQ113877009 ScholiaQ113877009MaRDI QIDQ2166313

Jade Hewitt, Tim Wagstrom, David Spivey, Michael Maxfield, Jeffrey A. Mudrock, Hemanshu Kaul, Jack Becker, Seth Thomason

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringchromatic polynomiallist coloringcorrespondence coloringDP-coloringDP-color function

Mathematics Subject Classification ID

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

Related Items

DP‐coloring Cartesian products of graphs ⋮ On the list color function threshold ⋮ 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
• 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
• On rigid circuit graphs
• The chromatic polynomial and list colorings
• A note on the DP-chromatic number of complete bipartite graphs
• Combinatorial Nullstellensatz and DP-coloring of graphs
• Answers to two questions on the DP color function
• Criticality, the list color function, and list coloring the Cartesian product of graphs
• On the chromatic polynomial and counting DP-colorings of graphs
• Incidence matrices and interval graphs
• DP-colorings of graphs with high chromatic number
• The asymptotic behavior of the correspondence chromatic number
• On the number of list‐colorings
• Algebraic Graph Theory
• The Johansson‐Molloy theorem for DP‐coloring