The strong fractional choice number of 3‐choice‐critical graphs
Rongxing Xu, Xuding Zhu · Journal of Graph Theory · 2022
Abstract A graph is called 3‐choice‐critical if is not 2‐choosable but any proper subgraph of is 2‐choosable. A graph is strongly fractional ‐choosable if is ‐choosable for all positive integers for which . The strong fractional choice number of is is strongly fractional ‐choosable. This paper determines the strong fractional choice number of all 3‐choice‐critical graphs.