Ilkyoo Choi

ScholarGPS® ID: 35417569167912

Affiliation

Hankuk University of Foreign Studies, Seoul, Yongin, South Korea

Affiliation History

Field

Physical Sciences and Mathematics

Discipline

Mathematics

Top Specialties

Discrete Mathematics | Food Coloring | Graph Theory | Combinatorics

Metrics Summary

Publication Count

Predicted Citations

229

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree (journal article) Choi, Ilkyoo \| Kierstead, H.A. \| Rabern, Landon Discrete Mathematics, volume 346, issue 11, pages 113300- (2023). 10.1016/j.disc.2022.113300 Cited by (1) \| Cite \| Source
A tight bound for independent domination of cubic graphs without 4‐cycles (journal article) Cho, Eun‐Kyung \| Choi, Ilkyoo \| Kwon, Hyemin \| Park, Boram Journal of Graph Theory, volume 104, issue 2, pages 372-386 (2023). 10.1002/jgt.22968 Cited by (1) \| Cite \| Source
Odd coloring of sparse graphs and planar graphs (journal article) Cho, Eun-Kyung \| Choi, Ilkyoo \| Kwon, Hyemin \| Park, Boram Discrete Mathematics, volume 346, issue 5, pages 113305- (2023). 10.1016/j.disc.2022.113305 Cited by (4) \| Cite \| Source
On independent domination of regular graphs (journal article) Cho, Eun‐Kyung \| Choi, Ilkyoo \| Park, Boram Journal of Graph Theory, volume 103, issue 1, pages 159-170 (2023). 10.1002/jgt.22912 Cited by (2) \| Cite \| Source
Improvements on Hippchen's conjecture (journal article) Cho, Eun-Kyung \| Choi, Ilkyoo \| Park, Boram Discrete Mathematics, volume 345, issue 11, pages 113029- (2022). 10.1016/j.disc.2022.113029 Cited by (1) \| Cite \| Source
Decomposing planar graphs into graphs with degree restrictions (journal article) Cho, Eun‐Kyung \| Choi, Ilkyoo \| Kim, Ringi \| Park, Boram \| Shan, Tingting \| Zhu, Xuding Journal of Graph Theory, volume 101, issue 2, pages 165-181 (2022). 10.1002/jgt.22817 Cited by (5) \| Cite \| Source
Flexibility of planar graphs—Sharpening the tools to get lists of size four (journal article) Choi, Ilkyoo \| Clemen, Felix Christian \| Ferrara, Michael \| Horn, Paul \| Ma, Fuhong \| Masařík, Tomáš Discrete Applied Mathematics, volume 306 (2022). 10.1016/j.dam.2021.09.021 Cited by (3) \| Cite \| Source
Generalized List Colouring of Graphs (journal article) Cho, Eun-Kyung \| Choi, Ilkyoo \| Jiang, Yiting \| Kim, Ringi \| Park, Boram \| Yan, Jiayan \| Zhu, Xuding Graphs and Combinatorics, volume 37, issue 6, pages 2121-2127 (2021). 10.1007/s00373-021-02336-3 Cite \| Source
The strong clique index of a graph with forbidden cycles (journal article) Cho, Eun‐Kyung \| Choi, Ilkyoo \| Kim, Ringi \| Park, Boram Journal of Graph Theory, volume 98, issue 2, pages 326-341 (2021). 10.1002/jgt.22700 Cited by (1) \| Cite \| Source
On star 5-colorings of sparse graphs (journal article) Choi, Ilkyoo \| Park, Boram Discrete Applied Mathematics, volume 294 (2021). 10.1016/j.dam.2021.02.009 Cite \| Source
Brick partition problems in three dimensions (journal article) Choi, Ilkyoo \| Kim, Minseong \| Seo, Kiwon Discrete Mathematics, volume 344, issue 4, pages 112288- (2021). 10.1016/j.disc.2021.112288 Cited by (1) \| Cite \| Source
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (journal article) Cho, Eun-Kyung \| Choi, Ilkyoo \| Park, Boram Discrete Mathematics, volume 344, issue 1, pages 112172- (2021). 10.1016/j.disc.2020.112172 Cited by (7) \| Cite \| Source
On induced saturation for paths (journal article) Cho, Eun-Kyung \| Choi, Ilkyoo \| Park, Boram European Journal of Combinatorics, volume 91 (2021). 10.1016/j.ejc.2020.103204 Cite \| Source
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles (journal article) Choi, Ilkyoo \| Cranston, Daniel W. \| Pierron, Théo Combinatorica, volume 40, issue 5, pages 625-653 (2020). 10.1007/s00493-019-4014-3 Cite \| Source
Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice (journal article) Choi, Ilkyoo \| Kim, Ringi \| Park, Boram The Electronic Journal of Combinatorics, volume 27, issue 4 (2020). 10.37236/8895 Cited by (1) \| Cite \| Source
The layer number of -evenly distributed point sets (journal article) Choi, Ilkyoo \| Joo, Weonyoung \| Kim, Minki Discrete Mathematics, volume 343, issue 10, pages 112029- (2020). 10.1016/j.disc.2020.112029 Cited by (2) \| Cite \| Source
Inducibility of directed paths (journal article) Choi, Ilkyoo \| Lidický, Bernard \| Pfender, Florian Discrete Mathematics, volume 343, issue 10, pages 112015- (2020). 10.1016/j.disc.2020.112015 Cited by (7) \| Cite \| Source
Partitioning sparse graphs into an independent set and a graph with bounded size components (journal article) Choi, Ilkyoo \| Dross, François \| Ochem, Pascal Discrete Mathematics, volume 343, issue 8, pages 111921- (2020). 10.1016/j.disc.2020.111921 Cited by (3) \| Cite \| Source
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path (journal article) Choi, Ilkyoo \| Kim, Jinha Discrete Applied Mathematics, volume 279 (2020). 10.1016/j.dam.2019.12.008 Cited by (1) \| Cite \| Source
A Ramsey-type theorem for the matching number regarding connected graphs (journal article) Choi, Ilkyoo \| Furuya, Michitaka \| Kim, Ringi \| Park, Boram Discrete Mathematics, volume 343, issue 2, pages 111648- (2020). 10.1016/j.disc.2019.111648 Cited by (3) \| Cite \| Source