Follow
ILKYOO CHOI
Title
Cited by
Cited by
Year
Locating a robber on a graph via distance queries
J Carraher, I Choi, M Delcourt, LH Erickson, DB West
Theoretical Computer Science 463, 54-61, 2012
422012
Planar graphs with girth at least 5 are (3, 5)-colorable
I Choi, A Raspaud
Discrete Mathematics 338 (4), 661-667, 2015
262015
Improper coloring of graphs on surfaces
I Choi, L Esperet
Journal of Graph Theory 91 (1), 16-34, 2019
252019
Odd coloring of sparse graphs and planar graphs
EK Cho, I Choi, H Kwon, B Park
Discrete Mathematics 346 (5), 113305, 2023
212023
On choosability with separation of planar graphs with forbidden cycles
I Choi, B Lidický, D Stolee
Journal of Graph Theory 81 (3), 283-306, 2016
202016
Vertex arboricity of toroidal graphs with a forbidden cycle
I Choi, H Zhang
Discrete Mathematics 333, 101-105, 2014
182014
(1, k)‐Coloring of Graphs with Girth at Least Five on a Surface
H Choi, I Choi, J Jeong, G Suh
Journal of Graph Theory 84 (4), 521-535, 2017
16*2017
Inducibility of directed paths
I Choi, B Lidický, F Pfender
Discrete Mathematics 343 (10), 112015, 2020
152020
Strong edge-colorings of sparse graphs with large maximum degree
I Choi, J Kim, AV Kostochka, A Raspaud
European Journal of Combinatorics 67, 21-39, 2018
152018
The difference and ratio of the fractional matching number and the matching number of graphs
I Choi, J Kim, O Suil
Discrete Mathematics 339 (4), 1382-1386, 2016
132016
Proper conflict-free coloring of sparse graphs
EK Cho, I Choi, H Kwon, B Park
arXiv preprint arXiv:2203.16390, 2022
102022
On independent domination of regular graphs
EK Cho, I Choi, B Park
Journal of Graph Theory, 2021
102021
Planar graphs with girth at least 5 are (3, 4)-colorable
I Choi, G Yu, X Zhang
Discrete Mathematics 342 (12), 111577, 2019
102019
Decomposing planar graphs into graphs with degree restrictions
EK Cho, I Choi, R Kim, B Park, T Shan, X Zhu
Journal of Graph Theory 101 (2), 165-181, 2022
82022
Flexibility of planar graphs—Sharpening the tools to get lists of size four
I Choi, FC Clemen, M Ferrara, P Horn, F Ma, T Masařík
Discrete Applied Mathematics 306, 120-132, 2022
82022
On induced saturation for paths
EK Cho, I Choi, B Park
European Journal of Combinatorics, 103204, 2020
82020
A Ramsey-type theorem for the matching number regarding connected graphs
I Choi, M Furuya, R Kim, B Park
Discrete Mathematics 343 (2), 111648, 2020
82020
Toroidal graphs containing neither K5− nor 6‐cycles are 4‐choosable
I Choi
Journal of Graph Theory 85 (1), 172-186, 2017
82017
Avoiding large squares in partial words
F Blanchet-Sadri, I Choi, R Mercaş
Theoretical Computer Science 412 (29), 3752-3758, 2011
82011
A tight bound for independent domination of cubic graphs without 4‐cycles
EK Cho, I Choi, H Kwon, B Park
Journal of Graph Theory 104 (2), 372-386, 2023
72023
The system can't perform the operation now. Try again later.
Articles 1–20