Publications

Submitted

• Tight upper bound on the clique size in the square of 2-degenerate graphs

(with Xiaopan Lian) 

• List dynamic 4-coloring of planar graphs 

(with Sang June Lee, Xiaopan Lian, and Xuding Zhu)

• The square of every subcubic planar graph of girth at least 6 is 7-choosable 

(with Xiaopan Lian)

Publication

[43]  Signed Planar graphs without intersecting 5-cycles are signed-4-choosable, 

Discrete Math. Algorithms Appl. 14 (2022), no. 5, Paper No. 2150151.  (with Xiaowei Yu)

[42]  Signed colouring and list colouring of k-chromatic graphs 

J. Graph Theory 99 (2022), no. 4, 637–650. (with Ringi Kim and Xuding Zhu)

[41]  The Alon-Tarsi number of K5-minor-free graphs 

Discrete Math. 345 (2022), no. 4, Paper No. 112764. (with Toshiki Abe and Kenta Ozeki)

[40]  On list 3-dynamic coloring of near-triangulations

Discrete Appl. Math. 288 (2021), 87–90. (with Ruijuan Gu, Yulai Ma, and Yongtang Shi) 

[39]  The minimum spectral radius of Kr+1-saturated graphs

Discrete Math. 343 (2020), no. 11, 112068. (with Jaehoon Kim,  Alexandr  Kostochka, and Suil O) 

[38]  On-line DP-coloring of graphs

Discrete Appl. Math. 285 (2020), 443–453. (with Alexandr Kostochka, Xuer Li, and Xuding Zhu)

[37]  Planar graphs without 7-cycles and butterflies are DP-4-colorable

Discrete Math. 343 (2020), no. 8, 111714. (with Runrun Liu and Gexin Yu)

[36]  Coloring squares of graphs with mad constraints

Discrete Appl. Math. 271 (2019), 64–73. (with Hervé Hocquard, Théo Pierron)

[35]  Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable

Graphs Combin. 35 (2019), no. 3, 707–718. (with Xiaowei Yu)

[34]  A note on a Brooks' type theorem for DP-coloring

J. Graph Theory 91 (2019), no. 2, 148–161. (with Kenta Ozeki)

[33]  3-dynamic coloring of planar triangulations

Discrete Math. 341 (2018), no. 11, 2988–2994. (with Yoshihiro Asayama, Yuki Kawasaki, Atsuhiro Nakamoto, and Kenta Ozeki)

[32]  Cycles with two blocks in k-chromatic digraphs

J. Graph Theory 88 (2018), no. 4, 592–605. (with Ringi Kim, Jie Ma, and Boram Park)

[31]  A sufficient condition for DP-4-colorability

Discrete Math. 341 (2018), no. 7, 1983–1986. (with Kenta Ozeki)

[30]  List 3-dynamic coloring of graphs with small maximum average degree

Discrete Math. 341 (2018), no. 5, 1406–1418. (with Boram Park)

[29]  Decomposition of sparse graphs into forests: the nine dragon tree conjecture for k≤2

J. Combin. Theory Ser. B 122 (2017), 741–756. (with Min Chen, Alexandr Kostochka, 

Douglas West, Xuding Zhu)

[28]  Coloring of the square of Kneser graph K(2k+r,k)

Graphs Combin. 32 (2016), no. 4, 1461–1472. (with Boram Park)

[27]  Coloring the square of graphs whose maximum average degree is less than 4

Discrete Math. 339 (2016), no. 4, 1251–1260. (with Boram Park)

[26]  Bipartite graphs whose squares are not chromatic-choosable

Electron. J. Combin. 22 (2015), no. 1, Paper 1.46, 12 pp. (with Boram Park)

[25]  Counterexamples to the list square coloring conjecture

J. Graph Theory 78 (2015), no. 4, 239–247. (with Boram Park)

[24]  Chromatic-choosability of the power of graphs

Discrete Appl. Math. 180 (2015), 120–125. (with Young Soo Kwon and Boram Park)

[23]  Improved bounds on the chromatic numbers of the square of Kneser graphs

Discrete Math. 315 (2014), 69–74. (with Boram Park)

[22]  Decomposition of sparse graphs into forests and a graph with bounded degree

J. Graph Theory 74 (2013), no. 4, 369–391. (with Alexandr Kostochka, Douglas West, , Hehui Wu, and Xuding Zhu)

[21]  Injectively (Δ+1)-choosable graphs

Ars Combin. 112 (2013), 449–457. (with Won-Jin Park)

[20]  Injectively delta choosable graphs

Bull. Korean Math. Soc. 50 (2013), no. 4, 1303–1314. (with Won-Jin Park)

[19]  Dynamic coloring and list dynamic coloring of planar graphs

Discrete Appl. Math. 161 (2013), no. 13-14, 2207–2212. (with Sang June Lee and Won-Jin Park)

[18]  Graph equation for line graphs and m-step graphs

Graphs Combin. 28 (2012), no. 6, 831–842. (with uh-Ryung Kim, Jung Yeun Lee, Won Jin Park, and  Yoshio Sano)

[17]  On-line list colouring of complete multipartite graphs

Electron. J. Combin. 19 (2012), no. 1, Paper 41, 13 pp. (with Young Soo Kwon, Daphne Der-Fen Liu and Xuding Zhu)

[16]  List dynamic coloring of sparse graphs

Lecture Notes in Comput. Sci., 6831,  Springer, Heidelberg, 2011, 156–162. (with Won-Jin Park)

[15]  The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes

Discrete Appl. Math. 159 (2011), no. 18, 2222–2228. (with Jon-Lark Kim)

[14]  Graphs having many holes but with small competition numbers

Appl. Math. Lett. 24 (2011), no. 8, 1331–1335. (with JungYeun Lee,  Suh-Ryung Kim, and Yoshio Sano)

[13]  Injective colorings of graphs with low average degree

Algorithmica 60 (2011), no. 3, 553–568. (with Daniel Cranston and Gexin Yu)

[12]  Injective colorings of sparse graphs

Discrete Math. 310 (2010), no. 21, 2965–2973. (with Daniel Cranston and Gexin Yu)

[11]  Identifying codes in q-ary hypercubes

Bull. Inst. Combin. Appl. 59 (2010), 93–102. (with Jon-Lark Kim)

[10]  The competition number of a graph with exactly two holes

Ars Combin. 95 (2010), 45–54. (with JungYeun Lee,  Suh-Ryung Kim, and Yoshio Sano)

[9]  Triangle-free planar graphs with minimum degree 3 have radius at least 3

Discuss. Math. Graph Theory 28 (2008), no. 3, 563–566. (with Douglas West)

[8]  Coloring the complements of intersection graphs of geometric figures

Discrete Math. 308 (2008), no. 20, 4589–4594. (with Kittikorn Nakprasit)

[7]  List-coloring the square of a subcubic graph

J. Graph Theory 57 (2008), no. 1, 65–87. (with Daniel Cranston)

[6]  On CCE graphs of doubly partial orders

Discrete Appl. Math. 155 (2007), no. 8, 971–978. (with Suh-Ryung Kim and Yoomi Rho)

[5]  Transversal numbers of translates of a convex body

Discrete Math. 306 (2006), no. 18, 2166–2173. (with Kittikorn Nakprasit, Michael Pelsmajer, and Jozef Skokan)

[4]  On the chromatic number of intersection graphs of convex sets in the plane

Electron. J. Combin. 11 (2004), no. 1, Research Paper 52, 12 pp. (with Alexandr Kostochka and Kittikorn Nakprasit)

[3]  On the chromatic number of the square of the Kneser graph K(2k+1,k)

Graphs Combin. 20 (2004), no. 1, 79–90. (with Kittikorn Nakprasit)

[2]  Homomorphisms from sparse graphs with large girth

J. Combin. Theory Ser. B 90 (2004), no. 1, 147–159.  (with O. V. Borodin, Alexandr Kostochka, and Douglas West)

[1]   Isometric cycles, cutsets, and crowning of bridged graphs

J. Graph Theory 43 (2003), no. 3, 161–170. (with Tao Jiang and Douglas West)