Ilkyoo Choi

According to our database, Ilkyoo Choi authored at least 41 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree.

Ilkyoo Choi, Henry A. Kierstead, Landon Rabern

Discret. Math., November, 2023

A tight bound for independent domination of cubic graphs without 4-cycles.

Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park

J. Graph Theory, October, 2023

On independent domination of regular graphs.

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

J. Graph Theory, May, 2023

Odd coloring of sparse graphs and planar graphs.

Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park

Discret. Math., May, 2023

2022

Decomposing planar graphs into graphs with degree restrictions.

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, Xuding Zhu

J. Graph Theory, 2022

Improvements on Hippchen's conjecture.

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Discret. Math., 2022

Flexibility of planar graphs - Sharpening the tools to get lists of size four.

Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara, Paul Horn, Fuhong Ma, Tomás Masarík

Discret. Appl. Math., 2022

2021

The strong clique index of a graph with forbidden cycles.

Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park

J. Graph Theory, 2021

Generalized List Colouring of Graphs.

Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park, Jiayan Yan, Xuding Zhu

Graphs Comb., 2021

On induced saturation for paths.

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Eur. J. Comb., 2021

Brick partition problems in three dimensions.

Ilkyoo Choi, Minseong Kim, Kiwon Seo

Discret. Math., 2021

Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests.

Eun-Kyung Cho, Ilkyoo Choi, Boram Park

Discret. Math., 2021

On star 5-colorings of sparse graphs.

Ilkyoo Choi, Boram Park

Discret. Appl. Math., 2021

2020

Inducibility of directed paths.

Ilkyoo Choi, Bernard Lidický, Florian Pfender

Discret. Math., 2020

The layer number of α-evenly distributed point sets.

Ilkyoo Choi, Weonyoung Joo, Minki Kim

Discret. Math., 2020

A Ramsey-type theorem for the matching number regarding connected graphs.

Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park

Discret. Math., 2020

Partitioning sparse graphs into an independent set and a graph with bounded size components.

Ilkyoo Choi, François Dross, Pascal Ochem

Discret. Math., 2020

A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path.

Ilkyoo Choi, Jinha Kim

Discret. Appl. Math., 2020

Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice.

Ilkyoo Choi, Ringi Kim, Boram Park

Electron. J. Comb., 2020

Collapsibility of Non-Cover Complexes of Graphs.

Ilkyoo Choi, Jinha Kim, Boram Park

Electron. J. Comb., 2020

Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles.

Ilkyoo Choi, Daniel W. Cranston, Théo Pierron

Comb., 2020

2019

Improper coloring of graphs on surfaces.

Ilkyoo Choi, Louis Esperet

J. Graph Theory, 2019

Online Ramsey theory for a triangle on -free graphs.

Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Sang-il Oum

J. Graph Theory, 2019

On operations preserving semi-transitive orientability of graphs.

Ilkyoo Choi, Jinha Kim, Minki Kim

J. Comb. Optim., 2019

Largest 2-Regular Subgraphs in 3-Regular Graphs.

Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West

Graphs Comb., 2019

Planar graphs with girth at least 5 are (3, 4)-colorable.

Ilkyoo Choi, Gexin Yu, Xia Zhang

Discret. Math., 2019

Characterization of forbidden subgraphs for bounded star chromatic number.

Ilkyoo Choi, Ringi Kim, Boram Park

Discret. Math., 2019

2018

Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs.

Ilkyoo Choi, Chun-Hung Liu, Sang-il Oum

SIAM J. Discret. Math., 2018

Strong edge-colorings of sparse graphs with large maximum degree.

Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud

Eur. J. Comb., 2018

3-coloring triangle-free planar graphs with a precolored 9-cycle.

Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický

Eur. J. Comb., 2018

On tiling the integers with 4-sets of the same gap sequence.

Ilkyoo Choi, Junehyuk Jung, Minki Kim

Discret. Math., 2018

2017

(1, <i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface.

Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Geewon Suh

J. Graph Theory, 2017

Toroidal graphs containing neither K5- nor 6-cycles are 4-choosable.

Ilkyoo Choi

J. Graph Theory, 2017

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors.

Ilkyoo Choi, O-joung Kwon, Sang-il Oum

J. Comb. Theory, Ser. B, 2017

2016

On Choosability with Separation of Planar Graphs with Forbidden Cycles.

Ilkyoo Choi, Bernard Lidický, Derrick Stolee

J. Graph Theory, 2016

The difference and ratio of the fractional matching number and the matching number of graphs.

Ilkyoo Choi, Jaehoon Kim, Suil O

Discret. Math., 2016

2015

Planar graphs with girth at least 5 are (3, 5)-colorable.

Ilkyoo Choi, André Raspaud

Discret. Math., 2015

2014

Vertex arboricity of toroidal graphs with a forbidden cycle.

Ilkyoo Choi, Haihui Zhang

Discret. Math., 2014

Equicovering Subgraphs of Graphs and Hypergraphs.

Ilkyoo Choi, Jaehoon Kim, Amelia Tebbe, Douglas B. West

Electron. J. Comb., 2014

2012

Locating a robber on a graph via distance queries.

James M. Carraher, Ilkyoo Choi, Michelle Delcourt, Lawrence H. Erickson, Douglas B. West

Theor. Comput. Sci., 2012

2011

Avoiding large squares in partial words.

Francine Blanchet-Sadri, Ilkyoo Choi, Robert Mercas

Theor. Comput. Sci., 2011