The DP color function of clique-gluings of graphs
From MaRDI portal
Publication:6659977
DOI10.54550/ECA2024V4S2R11MaRDI QIDQ6659977
Seth Thomason, Hemanshu Kaul, Michael Maxfield, J. A. Mudrock
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Graph minors. XVI: Excluding a non-planar graph
- A determinant formula for the number of ways of coloring a map.
- Clique-sums, tree-decompositions and compactness
- Answers to two questions on the DP color function
- DP color functions versus chromatic polynomials
- A deletion-contraction relation for the DP color function
- The DP color function of joins and vertex-gluings of graphs
- 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.
- On the number of list‐colorings
- Algebraic Graph Theory
- Two New Inequalities
- An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)
- DP color functions versus chromatic polynomials (II)
- DP‐coloring Cartesian products of graphs
- 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)
