A deletion-contraction relation for the DP color function
From MaRDI portal
Publication:2156187
DOI10.1007/s00373-022-02520-zzbMath1493.05109arXiv2107.08154OpenAlexW3184117261MaRDI QIDQ2156187
Publication date: 18 July 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.08154
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 (3)
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
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
- DP-3-coloring of some planar graphs
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
- 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
- On the chromatic polynomial and counting DP-colorings of graphs
- On DP-coloring of graphs and multigraphs
- The dissection of rectangles into squares
- 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: A deletion-contraction relation for the DP color function
