The DP color function of clique-gluings of graphs

DOI10.54550/ECA2024V4S2R11MaRDI QIDQ6659977FDOQ6659977

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)

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

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)

Cites Work

• Algebraic Graph Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The chromatic polynomial and list colorings
• Graph minors. XVI: Excluding a non-planar graph
• When does the list-coloring function of a graph equal its chromatic polynomial
• On the number of list‐colorings
• Clique-sums, tree-decompositions and compactness
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Two New Inequalities
• A determinant formula for the number of ways of coloring a map.
• Answers to two questions on the DP color function
• DP color functions versus chromatic polynomials
• 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
• List coloring and \(n\)-monophilic graphs.
• DP color functions versus chromatic polynomials (II)
• The DP color function of joins and vertex-gluings of graphs
• DP‐coloring Cartesian products of graphs
• An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)
• On the list color function threshold
• On polynomial representations of the DP color function: theta graphs and their generalizations

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)