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):
Displaying 17 items.
- When does the list-coloring function of a graph equal its chromatic polynomial (Q345104) (← links)
- A note on the DP-chromatic number of complete bipartite graphs (Q1783631) (← links)
- 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)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- DP-colorings of graphs with high chromatic number (Q2400975) (← links)
- Partial DP-coloring of graphs (Q2659213) (← links)
- Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
- On DP‐coloring of digraphs (Q5066911) (← 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)
- The DP color function of clique-gluings of graphs (Q6659977) (← links)