Pages that link to "Item:Q2906364"
From MaRDI portal
The following pages link to List coloring of complete multipartite graphs (Q2906364):
Displaying 19 items.
- Dynamic list coloring of bipartite graphs (Q608280) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Partial list colouring of certain graphs (Q888600) (← links)
- Choice number of some complete multi-partite graphs (Q1349076) (← links)
- Choosability and fractional chromatic numbers (Q1356727) (← links)
- On the choosability of complete multipartite graphs with part size three (Q1969804) (← links)
- Partial list colorings (Q1972145) (← links)
- Choosability and paintability of the lexicographic product of graphs (Q2030438) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Choice number of Kneser graphs (Q2166315) (← links)
- Bipartite graphs whose squares are not chromatic-choosable (Q2260619) (← links)
- List colorings with distinct list sizes, the case of complete bipartite graphs (Q2811205) (← links)
- List colorings with distinct list sizes, the case of complete bipartite graphs (Q2851483) (← links)
- Balanced list edge-colourings of bipartite graphs (Q2861497) (← links)
- Choice-perfect graphs (Q2866464) (← links)
- Degrees and choice numbers (Q4500691) (← links)
- Counterexamples to the List Square Coloring Conjecture (Q4982285) (← links)
- List-coloring embedded graphs (Q5741780) (← links)
- Coloring bipartite graphs with semi-small list size (Q6065679) (← links)