Pages that link to "Item:Q2221788"
From MaRDI portal
The following pages link to On the chromatic polynomial and counting DP-colorings of graphs (Q2221788):
Displayed 11 items.
- Answers to two questions on the DP color function (Q2030743) (← links)
- DP color functions versus chromatic polynomials (Q2070081) (← links)
- A deletion-contraction relation for the DP color function (Q2156187) (← links)
- The DP color function of joins and vertex-gluings of graphs (Q2166313) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
- Counting colorings of triangle-free graphs (Q6038582) (← links)
- DP color functions versus chromatic polynomials (II) (Q6047960) (← links)
- DP‐coloring Cartesian products of graphs (Q6074580) (← links)
- On the list color function threshold (Q6144915) (← links)
- An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)
