Boram Park

dblp:63/8048 · DBLP profile ↗
← Back
11ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0003-4102-1206ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 2 first-author · 3 since 2021
YearPublicationVenuePosition
2025 Proper conflict-free coloring of sparse graphs
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park
Discret. Appl. Math.4
2023 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
Boram Park
Discret. Appl. Math.1
2021 On star 5-colorings of sparse graphs
Ilkyoo Choi, Boram Park
Discret. Appl. Math.2
2020 Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-
Shinya Fujita 0001, Boram Park, Tadashi Sakuma
WG2
2016 The competition graphs of oriented complete bipartite graphs
Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano
Discret. Appl. Math.3
2015 Chromatic-choosability of the power of graphs
Seog-Jin Kim, Young Soo Kwon, Boram Park
Discret. Appl. Math.3
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.3
2014 The competition hypergraphs of doubly partial orders
Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano
Discret. Appl. Math.3
2013 The competition number of the complement of a cycle
Suh-Ryung Kim, Boram Park, Yoshio Sano
Discret. Appl. Math.2
2012 The competition numbers of complete multipartite graphs with many partite sets
Suh-Ryung Kim, Boram Park, Yoshio Sano
Discret. Appl. Math.2
2012 On Opsut's conjecture for hypercompetition numbers of hypergraphs
Boram Park, Suh-Ryung Kim
Discret. Appl. Math.1