Pages that link to "Item:Q2005703"

The following pages link to Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703):

Displaying 8 items.

• Answers to two questions on the DP color function (Q2030743) (← links)
• Edge-face list coloring of Halin graphs (Q2039700) (← 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)
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz (Q2168069) (← links)
• Partial DP-coloring of graphs (Q2659213) (← links)
• Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
• An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)