Selected Manuscripts

Submitted papers


  1. ILKYOO CHOI, O-joung Kwon, Sang-il Oum:
    Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
    Journal of Combinatorial Theory, Series B, 123 (2017) 126-147
    arXiv slides

    Toroidal graphs containing neither $K_5^-$ nor 6-cycles are 4-choosable
    Journal of Graph Theory, 85(1):172--186, 2017
    arXiv slides

  3. Hojin Choi, ILKYOO CHOI, Jisu Jeong, Geewon Suh:
    $(1, k)$-coloring of graphs with girth at least five on a surface
    Journal of Graph Theory, 84(4):521--535, 2017
    arXiv slides

  4. ILKYOO CHOI, Bernard Lidický, Derrick Stolee:
    On Choosability with Separation of Planar Graphs with Forbidden Cycles
    Journal of Graph Theory, 81(3):283--306, 2016
    arXiv slides

  5. ILKYOO CHOI, Jaehoon Kim, Suil O:
    The difference and ratio of the fractional matching number and the matching number of graphs
    Discrete Mathematics, 339(4):1382--1386, 2016

  6. ILKYOO CHOI, André Raspaud:
    Planar Graphs with Girth at least 5 are (3, 5)-colorable
    Discrete Mathematics, 338(4):661-667, 2015

  7. ILKYOO CHOI, Haihui Zhang:
    Vertex Arboricity of Toroidal Graphs with a Forbidden Cycle
    Discrete Mathematics, 333:101-105, 2014

  8. ILKYOO CHOI, Jaehoon Kim, Amelia Tebbe, Douglas B. West:
    Equicovering Subgraphs of Graphs and Hypergraphs
    The Electronic Journal of Combinatorics 21(1):Paper 1.62, 17, 2014

  9. James Carraher, ILKYOO CHOI, Michelle Delcourt, Lawrence H. Erickson, Douglas B. West:
    Locating a robber on a graph via distance queries
    Theoretical Computer Science 463:54–61, 2012

  10. Francine Blanchet-Sadri, ILKYOO CHOI, Robert Mercaş:
    Avoiding Large Squares in Partial Words
    Theoretical Computer Science 412(29):3752–3758, 2011

Ph. D. Thesis