The strong fractional choice number of 3-choice critical graphs

2020/10/17 by Rongxing Xu, Xu, Rongxing, Xuding Zhu +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2010.10257

openalex publication_date 2020/10/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A graph G is called 3-choice critical if G is not 2-choosable but any proper subgraph is 2-choosable. A graph G is strongly fractional r-choosable if G is (a,b)-choosable for all positive integers a,b for which a/b ≥ r. The strong fractional choice number of G is ch_f^s(G) = inf \r: G is strongly fractional r-choosable\. This paper determines the strong fractional choice number of all 3-choice critical graphs.

Related

• Strong fractional choice number of series-parallel graphs
• Multiple list colouring of 3-choice critical graphs
• Choice numbers of graphs
• Some results on (a:b)-choosability
• On the choice number of complete multipartite graphs with part size four