Pages that link to "Item:Q5229335"

The following pages link to The Johansson‐Molloy theorem for DP‐coloring (Q5229335):

Displaying 24 items.

• The list chromatic number of graphs with small clique number (Q1633755) (← links)
• Combinatorial Nullstellensatz and DP-coloring of graphs (Q2005703) (← links)
• Answers to two questions on the DP color function (Q2030743) (← links)
• Cover and variable degeneracy (Q2075519) (← 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)
• Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
• On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
• Partial DP-coloring of graphs (Q2659213) (← links)
• Non-chromatic-adherence of the DP color function via generalized theta graphs (Q2701400) (← links)
• (Q5009540) (← links)
• The $\chi$-Ramsey Problem for Triangle-Free Graphs (Q5074951) (← links)
• Colouring graphs with forbidden bipartite subgraphs (Q5885184) (← links)
• Independent transversals in bipartite correspondence-covers (Q5888915) (← links)
• Counting colorings of triangle-free graphs (Q6038582) (← links)
• Asymptotically good edge correspondence colourings (Q6081556) (← links)
• (Q6084349) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
• Extremal bipartite independence number and balanced coloring (Q6115783) (← links)
• Variable degeneracy on toroidal graphs (Q6143693) (← links)
• On triangle-free list assignments (Q6184549) (← links)
• An algebraic approach for counting DP-3-colorings of sparse graphs (Q6201884) (← links)
• New bounds for odd colourings of graphs (Q6671589) (← links)