The DP color function of clique-gluings of graphs

DOI10.54550/ECA2024V4S2R11MaRDI QIDQ6659977zbMATH OpenFDO

Authors Hemanshu Kaul, Michael Maxfield, J. A. Mudrock, Seth Thomason

Publication date 9 January 2025

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomialcorrespondence coloringDP-coloringDP color functionclique-gluingclique-sum

Mathematics Subject Classification ID

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

Recommendations

• The DP color function of joins and vertex-gluings of graphs
• On the chromatic polynomial and counting DP-colorings of graphs
• Answers to two questions on the DP color function
• On polynomial representations of the DP color function: theta graphs and their generalizations
• DP color functions versus chromatic polynomials

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• A deletion-contraction relation for the DP color function
• A determinant formula for the number of ways of coloring a map.
• Algebraic Graph Theory
• An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)
• Answers to two questions on the DP color function
• Clique-sums, tree-decompositions and compactness
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• DP color functions versus chromatic polynomials
• DP color functions versus chromatic polynomials (II)
• DP‐coloring Cartesian products of graphs
• Graph minors. XVI: Excluding a non-planar graph
• List coloring and \(n\)-monophilic graphs.
• Non-chromatic-adherence of the DP color function via generalized theta graphs
• On polynomial representations of the DP color function: theta graphs and their generalizations
• On the chromatic polynomial and counting DP-colorings of graphs
• On the list color function threshold
• On the number of list‐colorings
• The DP color function of joins and vertex-gluings of graphs
• The chromatic polynomial and list colorings
• Two New Inequalities
• When does the list-coloring function of a graph equal its chromatic polynomial

This page was built for publication: The DP color function of clique-gluings of graphs

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