| Year |
Citation |
Score |
| 2021 |
Gu R, Kim S, Ma Y, Shi Y. On list 3-dynamic coloring of near-triangulations Discrete Applied Mathematics. 288: 87-90. DOI: 10.1016/J.Dam.2020.08.009 |
0.465 |
|
| 2020 |
Kim S, Liu R, Yu G. Planar graphs without 7-cycles and butterflies are DP-4-colorable Discrete Mathematics. 343: 111714. DOI: 10.1016/J.Disc.2019.111714 |
0.369 |
|
| 2019 |
Hocquard H, Kim S, Pierron T. Coloring squares of graphs with mad constraints Discrete Applied Mathematics. 271: 64-73. DOI: 10.1016/J.Dam.2019.08.011 |
0.505 |
|
| 2019 |
Kim S, Yu X. Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable Graphs and Combinatorics. 35: 707-718. DOI: 10.1007/S00373-019-02028-Z |
0.304 |
|
| 2018 |
Asayama Y, Kawasaki Y, Kim S, Nakamoto A, Ozeki K. 3-dynamic coloring of planar triangulations Discrete Mathematics. 341: 2988-2994. DOI: 10.1016/J.Disc.2018.07.020 |
0.384 |
|
| 2018 |
Kim S, Ozeki K. A Sufficient condition for DP-4-colorability Discrete Mathematics. 341: 1983-1986. DOI: 10.1016/J.Disc.2018.03.027 |
0.35 |
|
| 2017 |
Kim S, Park B. List 3-dynamic coloring of graphs with small maximum average degree Discrete Mathematics. 341: 1406-1418. DOI: 10.1016/J.Disc.2017.09.025 |
0.359 |
|
| 2016 |
Kim SJ, Park B. Coloring the square of graphs whose maximum average degree is less than 4 Discrete Mathematics. 339: 1251-1260. DOI: 10.1016/J.Disc.2015.11.012 |
0.382 |
|
| 2015 |
Kim S, Park B. Bipartite graphs whose squares are not chromatic-choosable Electronic Journal of Combinatorics. 22: 1-46. DOI: 10.37236/4343 |
0.385 |
|
| 2015 |
Kim S, Kwon YS, Park B. Chromatic-choosability of the power of graphs Discrete Applied Mathematics. 180: 120-125. DOI: 10.1016/J.Dam.2014.08.004 |
0.38 |
|
| 2015 |
Kim S, Park B. Counterexamples to the List Square Coloring Conjecture Journal of Graph Theory. 78: 239-247. DOI: 10.1002/Jgt.21802 |
0.379 |
|
| 2013 |
Kim S, Park W. Injectively Delta Choosable Graphs Bulletin of the Korean Mathematical Society. 50: 1303-1314. DOI: 10.4134/Bkms.2013.50.4.1303 |
0.39 |
|
| 2013 |
Kim S, Lee SJ, Park W. Dynamic coloring and list dynamic coloring of planar graphs Discrete Applied Mathematics. 161: 2207-2212. DOI: 10.1016/J.Dam.2013.03.005 |
0.38 |
|
| 2012 |
Kim S, Kwon YS, Liu DD, Zhu X. On-Line List Colouring of Complete Multipartite Graphs Electronic Journal of Combinatorics. 19: 41. DOI: 10.37236/2050 |
0.355 |
|
| 2012 |
Kim S, Kim S, Lee JY, Park WJ, Sano Y. Graph Equation for Line Graphs and m-Step Graphs Graphs and Combinatorics. 28: 831-842. DOI: 10.1007/S00373-011-1081-7 |
0.386 |
|
| 2011 |
Kim J, Kim S. The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes Discrete Applied Mathematics. 159: 2222-2228. DOI: 10.1016/J.Dam.2011.07.022 |
0.342 |
|
| 2011 |
Lee JY, Kim S, Kim S, Sano Y. Graphs having many holes but with small competition numbers Applied Mathematics Letters. 24: 1331-1335. DOI: 10.1016/J.Aml.2011.03.003 |
0.378 |
|
| 2011 |
Cranston DW, Kim SJ, Yu G. Injective colorings of graphs with low average degree Algorithmica (New York). 60: 553-568. DOI: 10.1007/S00453-010-9425-X |
0.585 |
|
| 2010 |
Cranston DW, Kim SJ, Yu G. Injective colorings of sparse graphs Discrete Mathematics. 310: 2965-2973. DOI: 10.1016/J.Disc.2010.07.003 |
0.581 |
|
| 2008 |
Kim S, West DB. Triangle-free planar graphs with minimum degree 3 have radius at least 3 Discussiones Mathematicae Graph Theory. 28: 563-566. DOI: 10.7151/Dmgt.1428 |
0.507 |
|
| 2008 |
Kim SJ, Nakprasit K. Coloring the complements of intersection graphs of geometric figures Discrete Mathematics. 308: 4589-4594. DOI: 10.1016/J.Disc.2007.08.072 |
0.385 |
|
| 2007 |
Kim S, Kim S, Rho Y. On CCE graphs of doubly partial orders Discrete Applied Mathematics. 155: 971-978. DOI: 10.1016/J.Dam.2006.09.013 |
0.322 |
|
| 2006 |
Kim SJ, Nakprasit K, Pelsmajer MJ, Skokan J. Transversal numbers of translates of a convex body Discrete Mathematics. 306: 2166-2173. DOI: 10.1016/J.Disc.2006.05.014 |
0.512 |
|
| Show low-probability matches. |