The following pages link to A note on list-colorings (Q3828020):
Displaying 17 items.
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- The total chromatic number of nearly complete bipartite graphs (Q1179463) (← links)
- Colorings and orientations of graphs (Q1196681) (← links)
- Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
- List \(T\)-colorings of graphs (Q1309815) (← links)
- On the relations of various conjectures on Latin squares and straightening coefficients (Q1322185) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- On the Dinitz conjecture and related conjectures (Q1901032) (← links)
- List edge colourings of some 1-factorable multigraphs (Q2563511) (← links)
- On the Problem of Erdős and Hajnal in the Case of List Colorings (Q2851493) (← links)
- The Dinitz problem solved for rectangles (Q4275683) (← links)
- Choice Numbers of Graphs: a Probabilistic Approach (Q4291205) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- Amenable colorings (Q5906786) (← links)
