Pages that link to "Item:Q1003851"
From MaRDI portal
The following pages link to The chromatic polynomial and list colorings (Q1003851):
Displaying 18 items.
- When does the list-coloring function of a graph equal its chromatic polynomial (Q345104) (← links)
- Restraints permitting the largest number of colourings (Q1786873) (← 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)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- List coloring a Cartesian product with a complete bipartite factor (Q2287748) (← links)
- Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
- A broken cycle theorem for the restrained chromatic function (Q5742940) (← links)
- An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) (Q6038583) (← links)
- DP color functions versus chromatic polynomials (II) (Q6047960) (← links)
- DP‐coloring Cartesian products of graphs (Q6074580) (← links)
- Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II (Q6080166) (← links)
- The list-coloring function of signed graphs (Q6136674) (← links)
- On the list color function threshold (Q6144915) (← links)
- Bounding the list color function threshold from above (Q6148301) (← links)
- An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)
