The following pages link to (Q4882474):
Displaying 14 items.
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- The analogue of Erdős-Turán conjecture in \(\mathbb Z_m\) (Q954876) (← links)
- On list critical graphs (Q1044925) (← links)
- Choosability and fractional chromatic numbers (Q1356727) (← links)
- List colorings and reducibility (Q1372746) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- List coloring a Cartesian product with a complete bipartite factor (Q2287748) (← links)
- extremal aspects of the Erdős-Gallai-Tuza conjecture (Q2342626) (← links)
- On a Conjecture of Erdős, Gallai, and Tuza (Q2947853) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- The strong fractional choice number of 3‐choice‐critical graphs (Q6093154) (← links)
- Multiple list coloring of 3‐choice critical graphs (Q6134649) (← links)