Ilkyoo Choi

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 39

Top Topics

Independent Set

Graph Theoretic

Top Venues

J. Graph Theory

Discret. Appl. Math.

Electron. J. Comb.

Publications

Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický
Relaxation of Wegner's planar graph conjecture for maximum degree 4. Discret. Appl. Math. 358 (2024)
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park
Odd coloring of sparse graphs and planar graphs. Discret. Math. 346 (5) (2023)
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
On independent domination of regular graphs. J. Graph Theory 103 (1) (2023)
Ilkyoo Choi, Henry A. Kierstead, Landon Rabern
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree. Discret. Math. 346 (11) (2023)
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park
A tight bound for independent domination of cubic graphs without 4-cycles. J. Graph Theory 104 (2) (2023)
Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, Xuding Zhu
Decomposing planar graphs into graphs with degree restrictions. J. Graph Theory 101 (2) (2022)
Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík
Flexibility of planar graphs - Sharpening the tools to get lists of size four. Discret. Appl. Math. 306 (2022)
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
Improvements on Hippchen's conjecture. Discret. Math. 345 (11) (2022)
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
On induced saturation for paths. Eur. J. Comb. 91 (2021)
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. Discret. Math. 344 (1) (2021)
Ilkyoo Choi, Boram Park
On star 5-colorings of sparse graphs. Discret. Appl. Math. 294 (2021)
Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park, Jiayan Yan, Xuding Zhu
Generalized List Colouring of Graphs. Graphs Comb. 37 (6) (2021)
Ilkyoo Choi, Minseong Kim, Kiwon Seo
Brick partition problems in three dimensions. Discret. Math. 344 (4) (2021)
Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park
The strong clique index of a graph with forbidden cycles. J. Graph Theory 98 (2) (2021)
Ilkyoo Choi, Weonyoung Joo, Minki Kim
The layer number of α-evenly distributed point sets. Discret. Math. 343 (10) (2020)
Ilkyoo Choi, Ringi Kim, Boram Park
Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice. Electron. J. Comb. 27 (4) (2020)
Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park
A Ramsey-type theorem for the matching number regarding connected graphs. Discret. Math. 343 (2) (2020)
Ilkyoo Choi, Jinha Kim
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path. Discret. Appl. Math. 279 (2020)
Ilkyoo Choi, François Dross, Pascal Ochem
Partitioning sparse graphs into an independent set and a graph with bounded size components. Discret. Math. 343 (8) (2020)
Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík
Flexibility of Planar Graphs - Sharpening the Tools to Get Lists of Size Four. CoRR (2020)
Ilkyoo Choi, Jinha Kim, Boram Park
Collapsibility of Non-Cover Complexes of Graphs. Electron. J. Comb. 27 (1) (2020)
Ilkyoo Choi, Daniel W. Cranston, Théo Pierron
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. 40 (5) (2020)
Ilkyoo Choi, Bernard Lidický, Florian Pfender
Inducibility of directed paths. Discret. Math. 343 (10) (2020)
Ilkyoo Choi, Ringi Kim, Boram Park
Characterization of forbidden subgraphs for bounded star chromatic number. Discret. Math. 342 (3) (2019)
Ilkyoo Choi, Gexin Yu, Xia Zhang
Planar graphs with girth at least 5 are (3, 4)-colorable. Discret. Math. 342 (12) (2019)
Ilkyoo Choi, Jinha Kim, Minki Kim
On operations preserving semi-transitive orientability of graphs. J. Comb. Optim. 37 (4) (2019)
Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West
Largest 2-Regular Subgraphs in 3-Regular Graphs. Graphs Comb. 35 (4) (2019)
Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Sang-il Oum
Online Ramsey theory for a triangle on -free graphs. J. Graph Theory 92 (2) (2019)
Ilkyoo Choi, François Dross, Pascal Ochem
Partitioning sparse graphs into an independent set and a graph with bounded size components. CoRR (2019)
Ilkyoo Choi, Louis Esperet
Improper coloring of graphs on surfaces. J. Graph Theory 91 (1) (2019)
Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický
3-coloring triangle-free planar graphs with a precolored 9-cycle. Eur. J. Comb. 68 (2018)
Ilkyoo Choi, Chun-Hung Liu, Sang-il Oum
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs. SIAM J. Discret. Math. 32 (2) (2018)
Ilkyoo Choi, Junehyuk Jung, Minki Kim
On tiling the integers with 4-sets of the same gap sequence. Discret. Math. 341 (4) (2018)
Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud
Strong edge-colorings of sparse graphs with large maximum degree. Eur. J. Comb. 67 (2018)
Ilkyoo Choi, O-joung Kwon, Sang-il Oum
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. J. Comb. Theory, Ser. B 123 (2017)
Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Geewon Suh
)-Coloring of Graphs with Girth at Least Five on a Surface. J. Graph Theory 84 (4) (2017)
Ilkyoo Choi
Toroidal graphs containing neither K5- nor 6-cycles are 4-choosable. J. Graph Theory 85 (1) (2017)
Ilkyoo Choi, Bernard Lidický, Derrick Stolee
On Choosability with Separation of Planar Graphs with Forbidden Cycles. J. Graph Theory 81 (3) (2016)
Ilkyoo Choi, Jaehoon Kim, Suil O
The difference and ratio of the fractional matching number and the matching number of graphs. Discret. Math. 339 (4) (2016)
Ilkyoo Choi, André Raspaud
Planar graphs with girth at least 5 are (3, 5)-colorable. Discret. Math. 338 (4) (2015)
Ilkyoo Choi, Jaehoon Kim, Amelia Tebbe, Douglas B. West
Equicovering Subgraphs of Graphs and Hypergraphs. Electron. J. Comb. 21 (1) (2014)
Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle. IWOCA (2014)
Ilkyoo Choi, Haihui Zhang
Vertex arboricity of toroidal graphs with a forbidden cycle. Discret. Math. 333 (2014)
James M. Carraher, Ilkyoo Choi, Michelle Delcourt, Lawrence H. Erickson, Douglas B. West
Locating a robber on a graph via distance queries. Theor. Comput. Sci. 463 (2012)
Francine Blanchet-Sadri, Ilkyoo Choi, Robert Mercas
Avoiding large squares in partial words. Theor. Comput. Sci. 412 (29) (2011)