default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlkyoo Choi
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j43]Eun-Kyung Cho, Ilkyoo Choi
, Hyemin Kwon, Boram Park:
Brooks-type theorems for relaxations of square colorings. Discret. Math. 348(1): 114233 (2025)- 2024
- [j42]Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický:
Relaxation of Wegner's planar graph conjecture for maximum degree 4. Discret. Appl. Math. 358: 254-261 (2024) - 2023
- [j41]Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park:
Odd coloring of sparse graphs and planar graphs. Discret. Math. 346(5): 113305 (2023) - [j40]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): 113300 (2023) - [j39]Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
On independent domination of regular graphs. J. Graph Theory 103(1): 159-170 (2023) - [j38]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): 372-386 (2023) - 2022
- [j37]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: 120-132 (2022) - [j36]Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
Improvements on Hippchen's conjecture. Discret. Math. 345(11): 113029 (2022) - [j35]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): 165-181 (2022) - 2021
- [j34]Ilkyoo Choi, Boram Park:
On star 5-colorings of sparse graphs. Discret. Appl. Math. 294: 233-252 (2021) - [j33]Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. Discret. Math. 344(1): 112172 (2021) - [j32]Ilkyoo Choi, Minseong Kim, Kiwon Seo:
Brick partition problems in three dimensions. Discret. Math. 344(4): 112288 (2021) - [j31]Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
On induced saturation for paths. Eur. J. Comb. 91: 103204 (2021) - [j30]Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park, Jiayan Yan, Xuding Zhu:
Generalized List Colouring of Graphs. Graphs Comb. 37(6): 2121-2127 (2021) - [j29]Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park:
The strong clique index of a graph with forbidden cycles. J. Graph Theory 98(2): 326-341 (2021) - 2020
- [j28]Ilkyoo Choi, Daniel W. Cranston, Théo Pierron:
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. Comb. 40(5): 625-653 (2020) - [j27]Ilkyoo Choi, Jinha Kim, Boram Park:
Collapsibility of Non-Cover Complexes of Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j26]Ilkyoo Choi, Ringi Kim, Boram Park:
Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice. Electron. J. Comb. 27(4): 4 (2020) - [j25]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: 178-182 (2020) - [j24]Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park:
A Ramsey-type theorem for the matching number regarding connected graphs. Discret. Math. 343(2): 111648 (2020) - [j23]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): 111921 (2020) - [j22]Ilkyoo Choi, Bernard Lidický, Florian Pfender:
Inducibility of directed paths. Discret. Math. 343(10): 112015 (2020) - [j21]Ilkyoo Choi, Weonyoung Joo, Minki Kim:
The layer number of α-evenly distributed point sets. Discret. Math. 343(10): 112029 (2020) - [i2]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 abs/2004.10917 (2020)
2010 – 2019
- 2019
- [j20]Ilkyoo Choi, Ringi Kim, Boram Park:
Characterization of forbidden subgraphs for bounded star chromatic number. Discret. Math. 342(3): 635-642 (2019) - [j19]Ilkyoo Choi, Gexin Yu, Xia Zhang:
Planar graphs with girth at least 5 are (3, 4)-colorable. Discret. Math. 342(12) (2019) - [j18]Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West:
Largest 2-Regular Subgraphs in 3-Regular Graphs. Graphs Comb. 35(4): 805-813 (2019) - [j17]Ilkyoo Choi, Jinha Kim, Minki Kim:
On operations preserving semi-transitive orientability of graphs. J. Comb. Optim. 37(4): 1351-1366 (2019) - [j16]Ilkyoo Choi, Louis Esperet:
Improper coloring of graphs on surfaces. J. Graph Theory 91(1): 16-34 (2019) - [j15]Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Sang-il Oum:
Online Ramsey theory for a triangle on -free graphs. J. Graph Theory 92(2): 152-171 (2019) - [i1]Ilkyoo Choi, François Dross, Pascal Ochem:
Partitioning sparse graphs into an independent set and a graph with bounded size components. CoRR abs/1905.02123 (2019) - 2018
- [j14]Ilkyoo Choi, Junehyuk Jung, Minki Kim:
On tiling the integers with 4-sets of the same gap sequence. Discret. Math. 341(4): 957-964 (2018) - [j13]Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka, André Raspaud:
Strong edge-colorings of sparse graphs with large maximum degree. Eur. J. Comb. 67: 21-39 (2018) - [j12]Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický:
3-coloring triangle-free planar graphs with a precolored 9-cycle. Eur. J. Comb. 68: 38-65 (2018) - [j11]Ilkyoo Choi, Chun-Hung Liu, Sang-il Oum:
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs. SIAM J. Discret. Math. 32(2): 1209-1228 (2018) - 2017
- [j10]Ilkyoo Choi, O-joung Kwon, Sang-il Oum:
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. J. Comb. Theory B 123: 126-147 (2017) - [j9]Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Geewon Suh:
(1, k)-Coloring of Graphs with Girth at Least Five on a Surface. J. Graph Theory 84(4): 521-535 (2017) - [j8]Ilkyoo Choi:
Toroidal graphs containing neither K5- nor 6-cycles are 4-choosable. J. Graph Theory 85(1): 172-186 (2017) - 2016
- [j7]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): 1382-1386 (2016) - [j6]Ilkyoo Choi, Bernard Lidický, Derrick Stolee:
On Choosability with Separation of Planar Graphs with Forbidden Cycles. J. Graph Theory 81(3): 283-306 (2016) - 2015
- [j5]Ilkyoo Choi, André Raspaud:
Planar graphs with girth at least 5 are (3, 5)-colorable. Discret. Math. 338(4): 661-667 (2015) - 2014
- [j4]Ilkyoo Choi, Jaehoon Kim, Amelia Tebbe, Douglas B. West:
Equicovering Subgraphs of Graphs and Hypergraphs. Electron. J. Comb. 21(1): 1 (2014) - [j3]Ilkyoo Choi, Haihui Zhang:
Vertex arboricity of toroidal graphs with a forbidden cycle. Discret. Math. 333: 101-105 (2014) - [c1]Ilkyoo Choi, Jan Ekstein, Premysl Holub, Bernard Lidický:
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle. IWOCA 2014: 98-109 - 2012
- [j2]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: 54-61 (2012) - 2011
- [j1]Francine Blanchet-Sadri, Ilkyoo Choi, Robert Mercas:
Avoiding large squares in partial words. Theor. Comput. Sci. 412(29): 3752-3758 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
