Year |
Citation |
Score |
2020 |
Choi I, Kim J, Park B. Collapsibility of Non-Cover Complexes of Graphs Electronic Journal of Combinatorics. 27. DOI: 10.37236/8684 |
0.367 |
|
2020 |
Cho E, Choi I, Park B. On induced saturation for paths European Journal of Combinatorics. 103204. DOI: 10.1016/J.Ejc.2020.103204 |
0.41 |
|
2020 |
Choi I, Lidický B, Pfender F. Inducibility of directed paths Discrete Mathematics. 343: 112015. DOI: 10.1016/J.Disc.2020.112015 |
0.385 |
|
2020 |
Choi I, Dross F, Ochem P. Partitioning sparse graphs into an independent set and a graph with bounded size components Discrete Mathematics. 343: 111921. DOI: 10.1016/J.Disc.2020.111921 |
0.427 |
|
2020 |
Choi I, Furuya M, Kim R, Park B. A Ramsey-type theorem for the matching number regarding connected graphs Discrete Mathematics. 343: 111648. DOI: 10.1016/J.Disc.2019.111648 |
0.427 |
|
2020 |
Choi I, Kim J. A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path Discrete Applied Mathematics. 279: 178-182. DOI: 10.1016/J.Dam.2019.12.008 |
0.386 |
|
2020 |
Choi I, Cranston DW, Pierron T. Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles Combinatorica. 1-29. DOI: 10.1007/S00493-019-4014-3 |
0.4 |
|
2019 |
Choi I, Yu G, Zhang X. Planar graphs with girth at least 5 are (3,4)-colorable Discrete Mathematics. 342: 111577. DOI: 10.1016/J.Disc.2019.06.033 |
0.31 |
|
2019 |
Choi I, Kim R, Park B. Characterization of forbidden subgraphs for bounded star chromatic number Discrete Mathematics. 342: 635-642. DOI: 10.1016/J.Disc.2018.10.012 |
0.404 |
|
2019 |
Choi I, Kim J, Kim M. On operations preserving semi-transitive orientability of graphs Journal of Combinatorial Optimization. 37: 1351-1366. DOI: 10.1007/S10878-018-0358-7 |
0.394 |
|
2019 |
Choi I, Kim R, Kostochka AV, Park B, West DB. Largest 2-Regular Subgraphs in 3-Regular Graphs Graphs and Combinatorics. 35: 805-813. DOI: 10.1007/S00373-019-02021-6 |
0.406 |
|
2019 |
Choi H, Choi I, Jeong J, Oum S. Online Ramsey theory for a triangle on ‐free graphs Journal of Graph Theory. 92: 152-171. DOI: 10.1002/Jgt.22445 |
0.385 |
|
2019 |
Choi I, Esperet L. Improper coloring of graphs on surfaces Journal of Graph Theory. 91: 16-34. DOI: 10.1002/Jgt.22418 |
0.365 |
|
2018 |
Choi I, Liu C, Oum SI. Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs Siam Journal On Discrete Mathematics. 32: 1209-1228. DOI: 10.1137/16M1106882 |
0.384 |
|
2018 |
Choi I, Ekstein J, Holub P, Lidický B. 3-coloring triangle-free planar graphs with a precolored 9-cycle European Journal of Combinatorics. 68: 38-65. DOI: 10.1016/J.Ejc.2017.07.010 |
0.392 |
|
2018 |
Choi I, Kim J, Kostochka AV, Raspaud A. Strong edge-colorings of sparse graphs with large maximum degree European Journal of Combinatorics. 67: 21-39. DOI: 10.1016/J.Ejc.2017.06.001 |
0.388 |
|
2017 |
Choi I, Kwon O, Oum S. Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors Journal of Combinatorial Theory, Series B. 123: 126-147. DOI: 10.1016/J.Jctb.2016.11.007 |
0.402 |
|
2016 |
Choi I, Kim J, Suil O. The difference and ratio of the fractional matching number and the matching number of graphs Discrete Mathematics. 339: 1382-1386. DOI: 10.1016/J.Disc.2015.12.005 |
0.378 |
|
2016 |
Choi I. Toroidal graphs containing neither K5- nor 6-cycles are 4-choosable Journal of Graph Theory. DOI: 10.1002/Jgt.22054 |
0.421 |
|
2016 |
Choi H, Choi I, Jeong J, Suh G. (1, k)-Coloring of Graphs with Girth at Least Five on a Surface Journal of Graph Theory. DOI: 10.1002/Jgt.22039 |
0.401 |
|
2016 |
Choi I, Lidický B, Stolee D. On choosability with separation of planar graphs with forbidden cycles Journal of Graph Theory. 81: 283-306. DOI: 10.1002/Jgt.21875 |
0.429 |
|
2015 |
Choi I, Raspaud A. Planar graphs with girth at least 5 are ( 3 , 5 ) -colorable Discrete Mathematics. 338: 661-667. DOI: 10.1016/J.Disc.2014.11.012 |
0.396 |
|
2014 |
Choi I, Kim J, Tebbe A, West DB. Equicovering Subgraphs of Graphs and Hypergraphs Electronic Journal of Combinatorics. 21: 1-62. DOI: 10.37236/3999 |
0.319 |
|
2014 |
Choi I, Zhang H. Vertex arboricity of toroidal graphs with a forbidden cycle Discrete Mathematics. 333: 101-105. DOI: 10.1016/J.Disc.2014.06.011 |
0.423 |
|
2012 |
Carraher J, Choi I, Delcourt M, Erickson LH, West DB. Locating a robber on a graph via distance queries Theoretical Computer Science. 463: 54-61. DOI: 10.1016/J.Tcs.2012.06.035 |
0.419 |
|
Show low-probability matches. |