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
262012
Improper coloring of graphs on surfaces
I Choi, L Esperet
Journal of Graph Theory 91 (1), 16-34, 2019
202019
Planar graphs with girth at least 5 are (3, 5)-colorable
I Choi, A Raspaud
Discrete Mathematics 338 (4), 661-667, 2015
152015
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
132016
Vertex arboricity of toroidal graphs with a forbidden cycle
I Choi, H Zhang
Discrete Mathematics 333, 101-105, 2014
122014
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
112016
(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
72017
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
I Choi, O Kwon, S Oum
Journal of Combinatorial Theory, Series B 123, 126-147, 2017
62017
Toroidal graphs containing neither K5− nor 6‐cycles are 4‐choosable
I Choi
Journal of Graph Theory 85 (1), 172-186, 2017
52017
Avoiding large squares in partial words
F Blanchet-Sadri, I Choi, R Mercaş
Theoretical Computer Science 412 (29), 3752-3758, 2011
52011
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
42018
The layer number of -evenly distributed point sets
I Choi, W Joo, M Kim
arXiv preprint arXiv:2006.02822, 2020
32020
Characterization of cycle obstruction sets for improper coloring planar graphs
I Choi, CH Liu, S Oum
SIAM Journal on Discrete Mathematics 32 (2), 1209-1228, 2018
32018
-coloring of graphs with girth at least on a surface
H Choi, I Choi, J Jeong, G Suh
arXiv preprint arXiv:1412.0344, 2014
32014
Equicovering Subgraphs of Graphs and Hypergraphs
I Choi, J Kim, A Tebbe, DB West
The Electronic Journal of Combinatorics 21 (1), P1. 62, 2014
32014
On induced saturation for paths
EK Cho, I Choi, B Park
European Journal of Combinatorics, 103204, 2020
22020
Collapsibility of non-cover complexes of graphs
I Choi, J Kim, B Park
arXiv preprint arXiv:1904.10320, 2019
22019
3-coloring triangle-free planar graphs with a precolored 9-cycle
I Choi, J Ekstein, P Holub, B Lidický
European Journal of Combinatorics, 2017
22017
Inducibility of directed paths
I Choi, B Lidický, F Pfender
Discrete Mathematics 343 (10), 112015, 2020
12020
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
arXiv preprint arXiv:2004.10917, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20