The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. - Boram Park; Suh-Ryung Kim; Yoshio Sano (Discret. Math., 2009)

The competition numbers of Johnson graphs. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discuss. Math. Graph Theory, 2010)

The m-step competition graphs of doubly partial orders. - Boram Park; Jung Yeun Lee; Suh-Ryung Kim (Appl. Math. Lett., 2011)

The competition numbers of ternary Hamming graphs. - Boram Park; Yoshio Sano (Appl. Math. Lett., 2011)

On the hypercompetition numbers of hypergraphs. - Boram Park; Yoshio Sano (Ars Comb., 2011)

The competition number of a graph and the dimension of its hole space. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Appl. Math. Lett., 2012)

A Dice Rolling Game on a Set of Tori. - Jeehoon Kang; Suh-Ryung Kim; Boram Park (Electron. J. Comb., 2012)

The competition numbers of complete multipartite graphs with many partite sets. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discret. Appl. Math., 2012)

On Opsut's conjecture for hypercompetition numbers of hypergraphs. - Boram Park; Suh-Ryung Kim (Discret. Appl. Math., 2012)

The competition number of a generalized line graph is at most two. - Boram Park; Yoshio Sano (Discret. Math. Theor. Comput. Sci., 2012)

Population solidarity, population fair-ranking, and the egalitarian value. - Youngsub Chun; Boram Park (Int. J. Game Theory, 2012)

The impact of influential leaders in the formation and development of social networks. - Boram Park; Kibeom Lee; Namjun Kang (C&T, 2013)

The competition number of the complement of a cycle. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discret. Appl. Math., 2013)

The phylogeny graphs of double partial orders. - Boram Park; Yoshio Sano (Discuss. Math. Graph Theory, 2013)

On the cores of games arising from integer edge covering functions of graphs. - Boram Park; Suh-Ryung Kim; Hye Kyung Kim (J. Comb. Optim., 2013)

The competition hypergraphs of doubly partial orders. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Discret. Appl. Math., 2014)

Improved bounds on the chromatic numbers of the square of Kneser graphs. - Seog-Jin Kim; Boram Park (Discret. Math., 2014)

Bipartite Graphs whose Squares are not Chromatic-Choosable. - Seog-Jin Kim; Boram Park (Electron. J. Comb., 2015)

Chromatic-choosability of the power of graphs. - Seog-Jin Kim; Young Soo Kwon; Boram Park (Discret. Appl. Math., 2015)

A generalization of Opsut's result on the competition numbers of line graphs. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Discret. Appl. Math., 2015)

Counterexamples to the List Square Coloring Conjecture. - Seog-Jin Kim; Boram Park (J. Graph Theory, 2015)

The competition graphs of oriented complete bipartite graphs. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Discret. Appl. Math., 2016)

Coloring the square of graphs whose maximum average degree is less than 4. - Seog-Jin Kim; Boram Park (Discret. Math., 2016)

Coloring of the Square of Kneser Graph K(2k+r, k). - Seog-Jin Kim; Boram Park (Graphs Comb., 2016)

Shellable posets arising from the even subgraphs of a graph. - Boram Park; Seonjeong Park (Electron. Notes Discret. Math., 2017)

A graph theoretic approach to the slot allocation problem. - Youngsub Chun; Boram Park (Soc. Choice Welf., 2017)

On safe sets of the Cartesian product of two complete graphs. - Bumtle Kang; Suh-Ryung Kim; Boram Park (Ars Comb., 2018)

List 3-dynamic coloring of graphs with small maximum average degree. - Seog-Jin Kim; Boram Park (Discret. Math., 2018)

Cycles with two blocks in k-chromatic digraphs. - Ringi Kim; Seog-Jin Kim; Jie Ma 002; Boram Park (J. Graph Theory, 2018)

Characterization of forbidden subgraphs for bounded star chromatic number. - Ilkyoo Choi; Ringi Kim; Boram Park (Discret. Math., 2019)

On incidence choosability of cubic graphs. - Sungsik Kang; Boram Park (Discret. Math., 2019)

Largest 2-Regular Subgraphs in 3-Regular Graphs. - Ilkyoo Choi; Ringi Kim; Alexandr V. Kostochka; Boram Park; Douglas B. West (Graphs Comb., 2019)

On the weighted safe set problem on paths and cycles. - Shinya Fujita 001; Tommy Jensen; Boram Park; Tadashi Sakuma (J. Comb. Optim., 2019)

Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-. - Shinya Fujita 001; Boram Park; Tadashi Sakuma (WG, 2020)

Collapsibility of Non-Cover Complexes of Graphs. - Ilkyoo Choi; Jinha Kim; Boram Park (Electron. J. Comb., 2020)

Maximum $k$-Sum $ mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice. - Ilkyoo Choi; Ringi Kim; Boram Park (Electron. J. Comb., 2020)

A Ramsey-type theorem for the matching number regarding connected graphs. - Ilkyoo Choi; Michitaka Furuya; Ringi Kim; Boram Park (Discret. Math., 2020)

On star 5-colorings of sparse graphs. - Ilkyoo Choi; Boram Park (Discret. Appl. Math., 2021)

The optimal proper connection number of a graph with given independence number. - Shinya Fujita 001; Boram Park (Discret. Optim., 2021)

Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. - Eun-Kyung Cho; Ilkyoo Choi; Boram Park (Discret. Math., 2021)

Stable structure on safe set problems in vertex-weighted graphs. - Shinya Fujita 001; Boram Park; Tadashi Sakuma (Eur. J. Comb., 2021)

On induced saturation for paths. - Eun-Kyung Cho; Ilkyoo Choi; Boram Park (Eur. J. Comb., 2021)

Generalized List Colouring of Graphs. - Eun-Kyung Cho; Ilkyoo Choi; Yiting Jiang; Ringi Kim; Boram Park; Jiayan Yan; Xuding Zhu (Graphs Comb., 2021)

The strong clique index of a graph with forbidden cycles. - Eun-Kyung Cho; Ilkyoo Choi; Ringi Kim; Boram Park (J. Graph Theory, 2021)

Improvements on Hippchen's conjecture. - Eun-Kyung Cho; Ilkyoo Choi; Boram Park (Discret. Math., 2022)

Decomposing planar graphs into graphs with degree restrictions. - Eun-Kyung Cho; Ilkyoo Choi; Ringi Kim; Boram Park; Tingting Shan; Xuding Zhu (J. Graph Theory, 2022)

2-limited dominating broadcasts on cubic graphs without induced 4-cycles. - Boram Park (Discret. Appl. Math., 2023)

Odd coloring of sparse graphs and planar graphs. - Eun-Kyung Cho; Ilkyoo Choi; Hyemin Kwon; Boram Park (Discret. Math., 2023)

On independent domination of regular graphs. - Eun-Kyung Cho; Ilkyoo Choi; Boram Park (J. Graph Theory, 2023)

A tight bound for independent domination of cubic graphs without 4-cycles. - Eun-Kyung Cho; Ilkyoo Choi; Hyemin Kwon; Boram Park (J. Graph Theory, 2023)

Proper conflict-free coloring of sparse graphs. - Eun-Kyung Cho; Ilkyoo Choi; Hyemin Kwon; Boram Park (Discret. Appl. Math., 2025)

Brooks-type theorems for relaxations of square colorings. - Eun-Kyung Cho; Ilkyoo Choi; Hyemin Kwon; Boram Park (Discret. Math., 2025)