Boram Park

52 papers B 1Journal 50Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Brooks-type theorems for relaxations of square colorings.
Discret. Math.
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park
2025 J jnl
Proper conflict-free coloring of sparse graphs.
Discret. Appl. Math.
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park
2023 J jnl
2-limited dominating broadcasts on cubic graphs without induced 4-cycles.
Discret. Appl. Math.
Boram Park
2023 J jnl
A tight bound for independent domination of cubic graphs without 4-cycles.
J. Graph Theory
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park
2023 J jnl
Odd coloring of sparse graphs and planar graphs.
Discret. Math.
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park
2023 J jnl
On independent domination of regular graphs.
J. Graph Theory
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
2022 J jnl
Decomposing planar graphs into graphs with degree restrictions.
J. Graph Theory
Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, Xuding Zhu
2022 J jnl
Improvements on Hippchen's conjecture.
Discret. Math.
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
2021 J jnl
Generalized List Colouring of Graphs.
Graphs Comb.
Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park, Jiayan Yan, Xuding Zhu
2021 J jnl
On induced saturation for paths.
Eur. J. Comb.
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
2021 J jnl
On star 5-colorings of sparse graphs.
Discret. Appl. Math.
Ilkyoo Choi, Boram Park
2021 J jnl
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests.
Discret. Math.
Eun-Kyung Cho, Ilkyoo Choi, Boram Park
2021 J jnl
Stable structure on safe set problems in vertex-weighted graphs.
Eur. J. Comb.
Shinya Fujita, Boram Park, Tadashi Sakuma
2021 J jnl
The optimal proper connection number of a graph with given independence number.
Discret. Optim.
Shinya Fujita, Boram Park
2021 J jnl
The strong clique index of a graph with forbidden cycles.
J. Graph Theory
Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park
2020 J jnl
A Ramsey-type theorem for the matching number regarding connected graphs.
Discret. Math.
Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park
2020 J jnl
Collapsibility of Non-Cover Complexes of Graphs.
Electron. J. Comb.
Ilkyoo Choi, Jinha Kim, Boram Park
2020 J jnl
Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice.
Electron. J. Comb.
Ilkyoo Choi, Ringi Kim, Boram Park
2020 B conf
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.
WG
Shinya Fujita, Boram Park, Tadashi Sakuma
2019 J jnl
Characterization of forbidden subgraphs for bounded star chromatic number.
Discret. Math.
Ilkyoo Choi, Ringi Kim, Boram Park
2019 J jnl
Largest 2-Regular Subgraphs in 3-Regular Graphs.
Graphs Comb.
Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West
2019 J jnl
On incidence choosability of cubic graphs.
Discret. Math.
Sungsik Kang, Boram Park
2019 J jnl
On the weighted safe set problem on paths and cycles.
J. Comb. Optim.
Shinya Fujita, Tommy Jensen, Boram Park, Tadashi Sakuma
2018 J jnl
Cycles with two blocks in k-chromatic digraphs.
J. Graph Theory
Ringi Kim, Seog-Jin Kim, Jie Ma, Boram Park
2018 J jnl
List 3-dynamic coloring of graphs with small maximum average degree.
Discret. Math.
Seog-Jin Kim, Boram Park
2018 J jnl
On safe sets of the Cartesian product of two complete graphs.
Ars Comb.
Bumtle Kang, Suh-Ryung Kim, Boram Park
2017 J jnl
A graph theoretic approach to the slot allocation problem.
Soc. Choice Welf.
Youngsub Chun, Boram Park
2017 J jnl
Shellable posets arising from the even subgraphs of a graph.
Electron. Notes Discret. Math.
Boram Park, Seonjeong Park
2016 J jnl
Coloring of the Square of Kneser Graph K(2k+r, k).
Graphs Comb.
Seog-Jin Kim, Boram Park
2016 J jnl
Coloring the square of graphs whose maximum average degree is less than 4.
Discret. Math.
Seog-Jin Kim, Boram Park
2016 J jnl
The competition graphs of oriented complete bipartite graphs.
Discret. Appl. Math.
Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano
2015 J jnl
A generalization of Opsut's result on the competition numbers of line graphs.
Discret. Appl. Math.
Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano
2015 J jnl
Bipartite Graphs whose Squares are not Chromatic-Choosable.
Electron. J. Comb.
Seog-Jin Kim, Boram Park
2015 J jnl
Chromatic-choosability of the power of graphs.
Discret. Appl. Math.
Seog-Jin Kim, Young Soo Kwon, Boram Park
2015 J jnl
Counterexamples to the List Square Coloring Conjecture.
J. Graph Theory
Seog-Jin Kim, Boram Park
2014 J jnl
Improved bounds on the chromatic numbers of the square of Kneser graphs.
Discret. Math.
Seog-Jin Kim, Boram Park
2014 J jnl
The competition hypergraphs of doubly partial orders.
Discret. Appl. Math.
Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano
2013 J jnl
On the cores of games arising from integer edge covering functions of graphs.
J. Comb. Optim.
Boram Park, Suh-Ryung Kim, Hye Kyung Kim
2013 J jnl
The competition number of the complement of a cycle.
Discret. Appl. Math.
Suh-Ryung Kim, Boram Park, Yoshio Sano
2013 — conf
The impact of influential leaders in the formation and development of social networks.
C&T
Boram Park, Kibeom Lee, Namjun Kang
2013 J jnl
The phylogeny graphs of double partial orders.
Discuss. Math. Graph Theory
Boram Park, Yoshio Sano
2012 J jnl
A Dice Rolling Game on a Set of Tori.
Electron. J. Comb.
Jeehoon Kang, Suh-Ryung Kim, Boram Park
2012 J jnl
On Opsut's conjecture for hypercompetition numbers of hypergraphs.
Discret. Appl. Math.
Boram Park, Suh-Ryung Kim
2012 J jnl
Population solidarity, population fair-ranking, and the egalitarian value.
Int. J. Game Theory
Youngsub Chun, Boram Park
2012 J jnl
The competition number of a generalized line graph is at most two.
Discret. Math. Theor. Comput. Sci.
Boram Park, Yoshio Sano
2012 J jnl
The competition number of a graph and the dimension of its hole space.
Appl. Math. Lett.
Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano
2012 J jnl
The competition numbers of complete multipartite graphs with many partite sets.
Discret. Appl. Math.
Suh-Ryung Kim, Boram Park, Yoshio Sano
2011 J jnl
On the hypercompetition numbers of hypergraphs.
Ars Comb.
Boram Park, Yoshio Sano
2011 J jnl
The competition numbers of ternary Hamming graphs.
Appl. Math. Lett.
Boram Park, Yoshio Sano
2011 J jnl
The m-step competition graphs of doubly partial orders.
Appl. Math. Lett.
Boram Park, Jung Yeun Lee, Suh-Ryung Kim
2010 J jnl
The competition numbers of Johnson graphs.
Discuss. Math. Graph Theory
Suh-Ryung Kim, Boram Park, Yoshio Sano
2009 J jnl
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares.
Discret. Math.
Boram Park, Suh-Ryung Kim, Yoshio Sano