DP color functions of hypergraphs
From MaRDI portal
Cites work
- A determinant formula for the number of ways of coloring a map.
- A note on a broken-cycle theorem for hypergraphs
- An algebraic approach for counting DP-3-colorings of sparse graphs
- Answers to two questions on the DP color function
- Bounds for DP color function and canonical labelings
- Chromatic coefficients of linear uniform hypergraphs
- Colorings versus list colorings of uniform hypergraphs
- Combinatorial Nullstellensatz and DP-coloring of graphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- DP color functions versus chromatic polynomials
- DP-colorings of hypergraphs
- DP‐coloring Cartesian products of graphs
- Every Planar Map is Four Colorable
- 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 833904 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- On chromatic equivalence of graphs
- On chromaticity of hypergraphs
- On polynomial representations of the DP color function: theta graphs and their generalizations
- On the chromatic polynomial and counting DP-colorings of graphs
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- Some properties of chromatic coefficients of linear uniform hypergraphs
- The chromatic polynomial and list colorings
- The DP color function of joins and vertex-gluings of graphs
- Zero-free intervals of chromatic polynomials of hypergraphs
This page was built for publication: DP color functions of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232813)
