An algebraic approach for counting DP-3-colorings of sparse graphs
From MaRDI portal
Publication:6201884
DOI10.1016/j.ejc.2023.103890arXiv2212.12576MaRDI QIDQ6201884
Samantha L. Dahlberg, Jeffrey A. Mudrock, Hemanshu Kaul
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.12576
Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
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
- Many 3-colorings of triangle-free planar graphs
- The chromatic polynomial and list colorings
- Covering the cube by affine hyperplanes
- DP-3-coloring of some planar graphs
- 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
- DP color functions versus chromatic polynomials
- Graph polynomials and group coloring of graphs
- 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
- On DP-coloring of graphs and multigraphs
- Non-chromatic-adherence of the DP color function via generalized theta graphs
- 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
- An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)
- DP‐coloring Cartesian products of graphs
This page was built for publication: An algebraic approach for counting DP-3-colorings of sparse graphs