Pages that link to "Item:Q412279"
From MaRDI portal
The following pages link to Application of polynomial method to on-line list colouring of graphs (Q412279):
Displaying 13 items.
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- On-line DP-coloring of graphs (Q2197455) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- Partial Online List Coloring of Graphs (Q2862550) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
- Locally planar graphs are 2-defective 4-paintable (Q5964254) (← links)
- Chromatic λ‐choosable and λ‐paintable graphs (Q6056763) (← links)
