Ilkyoo Choi

activity

20132026

most citedStrong edge-colorings of sparse graphs with large maximum degree

17 citations · 116 across the 43 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

A lower bound on the number of edges in DP-critical graphs. II. Four colors

Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka +1

A graph $G$ is $k$ -critical (list $k$ -critical, DP $k$ -critical) if $χ (G) = k$ ( $χ_{ℓ} (G) = k$ , $χ_{DP} (G) = k$ ) and for every proper subgraph $G^{'}$ of $G$ , $χ (G^{'}) < k$ ($χ_\ell(…

math.CO2024

A lower bound on the number of edges in DP-critical graphs

Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka +1