Boram Park

495 total citations
56 papers, 230 citations indexed

About

Boram Park is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Boram Park has authored 56 papers receiving a total of 230 indexed citations (citations by other indexed papers that have themselves been cited), including 43 papers in Computational Theory and Mathematics, 23 papers in Discrete Mathematics and Combinatorics and 8 papers in Geometry and Topology. Recurrent topics in Boram Park's work include Advanced Graph Theory Research (41 papers), Graph Labeling and Dimension Problems (22 papers) and Limits and Structures in Graph Theory (22 papers). Boram Park is often cited by papers focused on Advanced Graph Theory Research (41 papers), Graph Labeling and Dimension Problems (22 papers) and Limits and Structures in Graph Theory (22 papers). Boram Park collaborates with scholars based in South Korea, Japan and United States. Boram Park's co-authors include Yoshio Sano, Suh-Ryung Kim, Seog‐Jin Kim, Youngsub Chun, Yukihiko Funaki, René van den Brink, Jean‐François Nierengarten, Uwe Hahn, Michel Holler and Iwona Nierengarten and has published in prestigious journals such as Chemistry - A European Journal, Linear Algebra and its Applications and Applied Mathematics Letters.

In The Last Decade

Boram Park

48 papers receiving 226 citations

Peers

Boram Park

CTM

DMC

CNC

EEE

EE

Borut Lužar Slovenia

Doost Ali Mojdeh Iran

F.K. Bell United Kingdom

B. D. Acharya India

Jun Yue China

Guihai Yu China

Alice A. McRae United States

Anna Torriero Italy

Aaron Williams Canada

‎Saeid Alikhani Iran

Borut Lužar Slovenia

Boram Park

213 ×1.4

CTM

104 ×1.9

DMC

23 ×0.6

CNC

53 ×1.5

EEE

5 ×0.2

EE

Citations per year, relative to Boram Park Boram Park (= 1×) peers Borut Lužar

Countries citing papers authored by Boram Park

Since Specialization

Citations

This map shows the geographic impact of Boram Park's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Boram Park with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Boram Park more than expected).

Fields of papers citing papers by Boram Park

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Boram Park. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Boram Park. The network helps show where Boram Park may publish in the future.

Co-authorship network of co-authors of Boram Park

This figure shows the co-authorship network connecting the top 25 collaborators of Boram Park. A scholar is included among the top collaborators of Boram Park based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Boram Park. Boram Park is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Park, Boram, et al.. (2024). Brooks-type theorems for relaxations of square colorings. Discrete Mathematics. 348(1). 114233–114233. 1 indexed citations

2.

Park, Boram, et al.. (2023). Odd coloring of sparse graphs and planar graphs. Discrete Mathematics. 346(5). 113305–113305. 8 indexed citations

3.

Park, Boram, et al.. (2023). A tight bound for independent domination of cubic graphs without 4‐cycles. Journal of Graph Theory. 104(2). 372–386. 5 indexed citations

4.

Park, Boram, et al.. (2020). Graph invariants and Betti numbers of real toric manifolds. Osaka Journal of Mathematics. 57(2). 333–356. 1 indexed citations

5.

Park, Boram, et al.. (2019). On incidence choosability of cubic graphs. Discrete Mathematics. 342(6). 1828–1837.

6.

Kim, Suh-Ryung, et al.. (2018). On safe sets of the Cartesian product of two complete graphs.. Ars Combinatoria. 141. 243–257. 4 indexed citations

7.

Park, Boram, et al.. (2017). A Study on the Strategy of Content Marketing Using YouTube - Focused on Domestic Standalone Beauty Brands -. Design Convergence Study. 16(2). 63–81. 5 indexed citations

8.

Kim, Seog‐Jin & Boram Park. (2016). KneserグラフK(2k+r,k)の正方形の彩色. Graphs and Combinatorics. 32(4). 1472. 1 indexed citations

9.

Park, Boram, et al.. (2015). A Study of Advertisement Avoidance by the Type of Digital Video In-stream Ad -Focused on the Youtube Users-. Journal of the Korean Society of Design Culture. 21(3). 665–673. 1 indexed citations

10.

Kim, Seog‐Jin & Boram Park. (2015). Coloring the square of graphs whose maximum average degree is less than 4. Discrete Mathematics. 339(4). 1251–1260. 4 indexed citations

11.

Park, Boram. (2014). Millennial Consumers’ Cause-Related Product Purchase Decision-Making Process and the Influence of Social Media. OhioLink ETD Center (Ohio Library and Information Network). 1 indexed citations

12.

Kim, Suh-Ryung, et al.. (2014). A generalization of Opsut’s result on the competition numbers of line graphs. Discrete Applied Mathematics. 181. 152–159. 2 indexed citations

13.

Kim, Seog‐Jin, Young Soo Kwon, & Boram Park. (2014). Chromatic-choosability of the power of graphs. Discrete Applied Mathematics. 180. 120–125. 5 indexed citations

14.

Kim, Seog‐Jin & Boram Park. (2013). Improved bounds on the chromatic numbers of the square of Kneser graphs. Discrete Mathematics. 315-316. 69–74. 2 indexed citations

15.

Park, Boram, et al.. (2012). A matrix sequence{Γ(Am)}m=1∞might converge even if the matrix A is not primitive. Linear Algebra and its Applications. 438(5). 2306–2319. 1 indexed citations

16.

Kim, Suh-Ryung, Boram Park, & Yoshio Sano. (2012). The competition numbers of complete multipartite graphs with many partite sets. Discrete Applied Mathematics. 160(7-8). 1176–1182. 5 indexed citations

17.

Park, Boram & Yoshio Sano. (2011). On the hypercompetition numbers of hypergraphs.. Ars Combinatoria. 100. 151–159. 5 indexed citations

18.

Kim, Suh-Ryung, Boram Park, & Yoshio Sano. (2011). The competition number of the complement of a cycle. Discrete Applied Mathematics. 161(12). 1755–1760. 5 indexed citations

19.

Kim, Suh-Ryung, et al.. (2011). The competition number of a graph and the dimension of its hole space. Applied Mathematics Letters. 25(3). 638–642. 2 indexed citations

20.

Park, Boram, et al.. (2010). The m-step competition graphs of doubly partial orders. Applied Mathematics Letters. 24(6). 811–816. 13 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact