Ilkyoo Choi

According to our database1, Ilkyoo Choi authored at least 28 papers between 2011 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





On induced saturation for paths.
Eur. J. Comb., 2021

Inducibility of directed paths.
Discret. Math., 2020

The layer number of α-evenly distributed point sets.
Discret. Math., 2020

A Ramsey-type theorem for the matching number regarding connected graphs.
Discret. Math., 2020

Partitioning sparse graphs into an independent set and a graph with bounded size components.
Discret. Math., 2020

A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path.
Discret. Appl. Math., 2020

Flexibility of Planar Graphs - Sharpening the Tools to Get Lists of Size Four.
CoRR, 2020

Collapsibility of Non-Cover Complexes of Graphs.
Electron. J. Comb., 2020

Improper coloring of graphs on surfaces.
J. Graph Theory, 2019

Online Ramsey theory for a triangle on -free graphs.
J. Graph Theory, 2019

On operations preserving semi-transitive orientability of graphs.
J. Comb. Optim., 2019

Largest 2-Regular Subgraphs in 3-Regular Graphs.
Graphs Comb., 2019

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

Characterization of forbidden subgraphs for bounded star chromatic number.
Discret. Math., 2019

Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs.
SIAM J. Discret. Math., 2018

Strong edge-colorings of sparse graphs with large maximum degree.
Eur. J. Comb., 2018

3-coloring triangle-free planar graphs with a precolored 9-cycle.
Eur. J. Comb., 2018

On tiling the integers with 4-sets of the same gap sequence.
Discret. Math., 2018

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

Toroidal graphs containing neither K5- nor 6-cycles are 4-choosable.
J. Graph Theory, 2017

Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors.
J. Comb. Theory, Ser. B, 2017

On Choosability with Separation of Planar Graphs with Forbidden Cycles.
J. Graph Theory, 2016

The difference and ratio of the fractional matching number and the matching number of graphs.
Discret. Math., 2016

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

Vertex arboricity of toroidal graphs with a forbidden cycle.
Discret. Math., 2014

Equicovering Subgraphs of Graphs and Hypergraphs.
Electron. J. Comb., 2014

Locating a robber on a graph via distance queries.
Theor. Comput. Sci., 2012

Avoiding large squares in partial words.
Theor. Comput. Sci., 2011