default search action
Boram Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j49]Eun-Kyung Cho, Ilkyoo Choi
, Hyemin Kwon, Boram Park:
Brooks-type theorems for relaxations of square colorings. Discret. Math. 348(1): 114233 (2025) - 2023
- [j48]Boram Park
2-limited dominating broadcasts on cubic graphs without induced 4-cycles. Discret. Appl. Math. 327: 178-184 (2023) - [j47]Eun-Kyung Cho, Ilkyoo Choi
Odd coloring of sparse graphs and planar graphs. Discret. Math. 346(5): 113305 (2023) - [j46]Eun-Kyung Cho, Ilkyoo Choi
On independent domination of regular graphs. J. Graph Theory 103(1): 159-170 (2023) - [j45]Eun-Kyung Cho
A tight bound for independent domination of cubic graphs without 4-cycles. J. Graph Theory 104(2): 372-386 (2023) - 2022
- [j44]Eun-Kyung Cho
Improvements on Hippchen's conjecture. Discret. Math. 345(11): 113029 (2022) - [j43]Eun-Kyung Cho
Decomposing planar graphs into graphs with degree restrictions. J. Graph Theory 101(2): 165-181 (2022) - 2021
- [j42]Ilkyoo Choi
On star 5-colorings of sparse graphs. Discret. Appl. Math. 294: 233-252 (2021) - [j41]Shinya Fujita, Boram Park
The optimal proper connection number of a graph with given independence number. Discret. Optim. 41: 100660 (2021) - [j40]Eun-Kyung Cho
Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. Discret. Math. 344(1): 112172 (2021) - [j39]Eun-Kyung Cho
On induced saturation for paths. Eur. J. Comb. 91: 103204 (2021) - [j38]Shinya Fujita, Boram Park, Tadashi Sakuma
Stable structure on safe set problems in vertex-weighted graphs. Eur. J. Comb. 91: 103211 (2021) - [j37]Eun-Kyung Cho
Generalized List Colouring of Graphs. Graphs Comb. 37(6): 2121-2127 (2021) - [j36]Eun-Kyung Cho
The strong clique index of a graph with forbidden cycles. J. Graph Theory 98(2): 326-341 (2021) - 2020
- [j35]Ilkyoo Choi, Jinha Kim
Collapsibility of Non-Cover Complexes of Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j34]Ilkyoo Choi, Ringi Kim, Boram Park:
Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice. Electron. J. Comb. 27(4): 4 (2020) - [j33]Ilkyoo Choi, Michitaka Furuya, Ringi Kim, Boram Park:
A Ramsey-type theorem for the matching number regarding connected graphs. Discret. Math. 343(2): 111648 (2020) - [c2]Shinya Fujita
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-. WG 2020: 364-375
2010 – 2019
- 2019
- [j32]Ilkyoo Choi
Characterization of forbidden subgraphs for bounded star chromatic number. Discret. Math. 342(3): 635-642 (2019) - [j31]Sungsik Kang, Boram Park
On incidence choosability of cubic graphs. Discret. Math. 342(6): 1828-1837 (2019) - [j30]Ilkyoo Choi, Ringi Kim, Alexandr V. Kostochka, Boram Park, Douglas B. West:
Largest 2-Regular Subgraphs in 3-Regular Graphs. Graphs Comb. 35(4): 805-813 (2019) - [j29]Shinya Fujita, Tommy Jensen, Boram Park
On the weighted safe set problem on paths and cycles. J. Comb. Optim. 37(2): 685-701 (2019) - 2018
- [j28]Bumtle Kang, Suh-Ryung Kim, Boram Park:
On safe sets of the Cartesian product of two complete graphs. Ars Comb. 141: 243-257 (2018) - [j27]Seog-Jin Kim, Boram Park:
List 3-dynamic coloring of graphs with small maximum average degree. Discret. Math. 341(5): 1406-1418 (2018) - [j26]Ringi Kim
Cycles with two blocks in k-chromatic digraphs. J. Graph Theory 88(4): 592-605 (2018) - 2017
- [j25]Boram Park, Seonjeong Park:
Shellable posets arising from the even subgraphs of a graph. Electron. Notes Discret. Math. 61: 963-969 (2017) - [j24]Youngsub Chun, Boram Park:
A graph theoretic approach to the slot allocation problem. Soc. Choice Welf. 48(1): 133-152 (2017) - 2016
- [j23]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition graphs of oriented complete bipartite graphs. Discret. Appl. Math. 201: 182-190 (2016) - [j22]Seog-Jin Kim, Boram Park:
Coloring the square of graphs whose maximum average degree is less than 4. Discret. Math. 339(4): 1251-1260 (2016) - [j21]Seog-Jin Kim, Boram Park:
Coloring of the Square of Kneser Graph K(2k+r, k). Graphs Comb. 32(4): 1461-1472 (2016) - 2015
- [j20]Seog-Jin Kim, Boram Park:
Bipartite Graphs whose Squares are not Chromatic-Choosable. Electron. J. Comb. 22(1): 1 (2015) - [j19]Seog-Jin Kim, Young Soo Kwon, Boram Park:
Chromatic-choosability of the power of graphs. Discret. Appl. Math. 180: 120-125 (2015) - [j18]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
A generalization of Opsut's result on the competition numbers of line graphs. Discret. Appl. Math. 181: 152-159 (2015) - [j17]Seog-Jin Kim, Boram Park:
Counterexamples to the List Square Coloring Conjecture. J. Graph Theory 78(4): 239-247 (2015) - 2014
- [j16]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition hypergraphs of doubly partial orders. Discret. Appl. Math. 165: 185-191 (2014) - [j15]Seog-Jin Kim, Boram Park:
Improved bounds on the chromatic numbers of the square of Kneser graphs. Discret. Math. 315-316: 69-74 (2014) - 2013
- [j14]Suh-Ryung Kim, Boram Park, Yoshio Sano:
The competition number of the complement of a cycle. Discret. Appl. Math. 161(12): 1755-1760 (2013) - [j13]Boram Park, Yoshio Sano:
The phylogeny graphs of double partial orders. Discuss. Math. Graph Theory 33(4): 657-664 (2013) - [j12]Boram Park, Suh-Ryung Kim, Hye Kyung Kim:
On the cores of games arising from integer edge covering functions of graphs. J. Comb. Optim. 26(4): 786-798 (2013) - [c1]Boram Park, Kibeom Lee, Namjun Kang:
The impact of influential leaders in the formation and development of social networks. C&T 2013: 8-15 - 2012
- [j11]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition number of a graph and the dimension of its hole space. Appl. Math. Lett. 25(3): 638-642 (2012) - [j10]Jeehoon Kang
A Dice Rolling Game on a Set of Tori. Electron. J. Comb. 19(1): 54 (2012) - [j9]Suh-Ryung Kim, Boram Park, Yoshio Sano:
The competition numbers of complete multipartite graphs with many partite sets. Discret. Appl. Math. 160(7-8): 1176-1182 (2012) - [j8]Boram Park, Suh-Ryung Kim:
On Opsut's conjecture for hypercompetition numbers of hypergraphs. Discret. Appl. Math. 160(15): 2286-2293 (2012) - [j7]Boram Park, Yoshio Sano:
The competition number of a generalized line graph is at most two. Discret. Math. Theor. Comput. Sci. 14(2): 1-10 (2012) - [j6]Youngsub Chun, Boram Park:
Population solidarity, population fair-ranking, and the egalitarian value. Int. J. Game Theory 41(2): 255-270 (2012) - 2011
- [j5]Boram Park, Jung Yeun Lee, Suh-Ryung Kim:
The m-step competition graphs of doubly partial orders. Appl. Math. Lett. 24(6): 811-816 (2011) - [j4]Boram Park, Yoshio Sano:
The competition numbers of ternary Hamming graphs. Appl. Math. Lett. 24(9): 1608-1613 (2011) - [j3]Boram Park, Yoshio Sano:
On the hypercompetition numbers of hypergraphs. Ars Comb. 100: 151-159 (2011) - 2010
- [j2]Suh-Ryung Kim, Boram Park, Yoshio Sano:
The competition numbers of Johnson graphs. Discuss. Math. Graph Theory 30(3): 449-459 (2010)
2000 – 2009
- 2009
- [j1]Boram Park, Suh-Ryung Kim, Yoshio Sano:
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. Discret. Math. 309(23-24): 6464-6469 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: