Pages that link to "Item:Q426807"
From MaRDI portal
The following pages link to On-line list colouring of complete multipartite graphs (Q426807):
Displaying 12 items.
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- Sum-paintability of generalized theta-graphs (Q497323) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- On-line DP-coloring of graphs (Q2197455) (← links)
- Bounds on partial online list colouring (Q2398499) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- Partial online list coloring of graphs (Q2862550) (← links)
- On choosability of complete multipartite graphs K<sub>4,3*t,2*(k-2t-2),1*(t+1)</sub> (Q3059092) (← links)
- (Q5047016) (← links)
- Locally planar graphs are 2-defective 4-paintable (Q5964254) (← links)
- Chromatic λ‐choosable and λ‐paintable graphs (Q6056763) (← links)