Ilkyoo Choi

From MaRDI portal
Person:400410

Available identifiers

zbMath Open choi.ilkyooMaRDI QIDQ400410

List of research outcomes

PublicationDate of PublicationType
The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree2023-11-27Paper
On independent domination of regular graphs2023-10-09Paper
A tight bound for independent domination of cubic graphs without 4‐cycles2023-10-09Paper
Decomposing planar graphs into graphs with degree restrictions2023-10-05Paper
The strong clique index of a graph with forbidden cycles2023-10-04Paper
Odd coloring of sparse graphs and planar graphs2023-03-10Paper
Relaxation of Wegner's Planar Graph Conjecture for maximum degree 42022-12-20Paper
Improvements on Hippchen's conjecture2022-08-24Paper
Proper conflict-free coloring of sparse graphs2022-03-30Paper
Odd coloring of sparse graphs and planar graphs2022-02-22Paper
Generalized list colouring of graphs2021-11-30Paper
Flexibility of planar graphs -- sharpening the tools to get lists of size four2021-11-11Paper
Brick partition problems in three dimensions2021-03-25Paper
Degeneracy and colorings of squares of planar graphs without 4-cycles2021-03-20Paper
On star 5-colorings of sparse graphs2021-03-17Paper
On induced saturation for paths2021-02-08Paper
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests2021-01-21Paper
Maximum \(k\)-sum \(\mathbf{n}\)-free sets of the 2-dimensional integer lattice2020-10-20Paper
Inducibility of directed paths2020-08-12Paper
The layer number of \(\alpha \)-evenly distributed point sets2020-08-12Paper
Partitioning sparse graphs into an independent set and a graph with bounded size components2020-06-08Paper
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path2020-05-18Paper
Collapsibility of non-cover complexes of graphs2020-01-27Paper
A Ramsey-type theorem for the matching number regarding connected graphs2019-12-17Paper
Online Ramsey theory for a triangle on ‐free graphs2019-10-31Paper
Planar graphs with girth at least 5 are \((3, 4)\)-colorable2019-10-17Paper
Largest 2-regular subgraphs in 3-regular graphs2019-06-28Paper
On operations preserving semi-transitive orientability of graphs2019-06-25Paper
Improper coloring of graphs on surfaces2019-06-14Paper
Characterization of forbidden subgraphs for bounded star chromatic number2019-01-22Paper
Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs2018-06-07Paper
On tiling the integers with 4-sets of the same gap sequence2018-02-23Paper
3-coloring triangle-free planar graphs with a precolored 9-cycle2017-11-14Paper
Strong edge-colorings of sparse graphs with large maximum degree2017-10-10Paper
Toroidal graphs containing neither nor 6‐cycles are 4‐choosable2017-06-30Paper
(1,k)-Coloring of Graphs with Girth at Least Five on a Surface2017-04-21Paper
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors2017-01-26Paper
On Choosability with Separation of Planar Graphs with Forbidden Cycles2016-04-15Paper
The difference and ratio of the fractional matching number and the matching number of graphs2016-01-21Paper
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle2015-09-29Paper
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle2015-09-15Paper
Planar graphs with girth at least 5 are \((3, 5)\)-colorable2015-01-23Paper
Equicovering subgraphs of graphs and hypergraphs2014-09-04Paper
Vertex arboricity of toroidal graphs with a forbidden cycle2014-08-21Paper
Locating a robber on a graph via distance queries2013-01-07Paper
Avoiding large squares in partial words2011-07-14Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ilkyoo Choi