Seog‐Jin Kim

555 total citations
32 papers, 265 citations indexed

About

Seog‐Jin Kim is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Seog‐Jin Kim has authored 32 papers receiving a total of 265 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 17 papers in Discrete Mathematics and Combinatorics and 8 papers in Electrical and Electronic Engineering. Recurrent topics in Seog‐Jin Kim's work include Advanced Graph Theory Research (29 papers), Graph Labeling and Dimension Problems (21 papers) and Limits and Structures in Graph Theory (17 papers). Seog‐Jin Kim is often cited by papers focused on Advanced Graph Theory Research (29 papers), Graph Labeling and Dimension Problems (21 papers) and Limits and Structures in Graph Theory (17 papers). Seog‐Jin Kim collaborates with scholars based in South Korea, United States and China. Seog‐Jin Kim's co-authors include Daniel W. Cranston, Gexin Yu, Kenta Ozeki, Boram Park, Xuding Zhu, Suh-Ryung Kim, Young Soo Kwon, Alexandr Kostochka, Daphne Der‐Fen Liu and Jon-Lark Kim and has published in prestigious journals such as Applied Mathematics Letters, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Seog‐Jin Kim

32 papers receiving 259 citations

Peers

Seog‐Jin Kim
Louis Esperet France
Mirko Horňák Slovakia
Arnfried Kemnitz Germany
Robert Šámal Czechia
Sophie Spirkl United States
Marthe Bonamy France
Alexandre Pinlou France
Julia Böttcher United Kingdom
Edita Máčajová Slovakia
Marietjie Frick South Africa
Louis Esperet France
Seog‐Jin Kim
Citations per year, relative to Seog‐Jin Kim Seog‐Jin Kim (= 1×) peers Louis Esperet

Countries citing papers authored by Seog‐Jin Kim

Since Specialization
Citations

This map shows the geographic impact of Seog‐Jin Kim'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 Seog‐Jin Kim with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Seog‐Jin Kim more than expected).

Fields of papers citing papers by Seog‐Jin Kim

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Seog‐Jin Kim. 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 Seog‐Jin Kim. The network helps show where Seog‐Jin Kim may publish in the future.

Co-authorship network of co-authors of Seog‐Jin Kim

This figure shows the co-authorship network connecting the top 25 collaborators of Seog‐Jin Kim. A scholar is included among the top collaborators of Seog‐Jin Kim 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 Seog‐Jin Kim. Seog‐Jin Kim is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Kim, Seog‐Jin, et al.. (2024). The square of every subcubic planar graph of girth at least 6 is 7-choosable. Discrete Mathematics. 347(6). 113963–113963. 1 indexed citations
2.
Jun, Zhao, et al.. (2020). Simple New Proofs of the Characteristic Functions of the F and Skew-Normal Distributions. Symmetry. 12(12). 2041–2041. 3 indexed citations
3.
Kim, Seog‐Jin, et al.. (2020). On-line DP-coloring of graphs. Discrete Applied Mathematics. 285. 443–453. 3 indexed citations
4.
Kim, Seog‐Jin, et al.. (2019). Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discrete Mathematics. 343(8). 111714–111714. 1 indexed citations
5.
Kim, Seog‐Jin, et al.. (2018). 3-dynamic coloring of planar triangulations. Discrete Mathematics. 341(11). 2988–2994. 3 indexed citations
6.
Kim, Seog‐Jin & Kenta Ozeki. (2018). A sufficient condition for DP-4-colorability. Discrete Mathematics. 341(7). 1983–1986. 20 indexed citations
7.
Kim, Seog‐Jin & Kenta Ozeki. (2018). A note on a Brooks' type theorem for DP‐coloring. Journal of Graph Theory. 91(2). 148–161. 12 indexed citations
8.
Kim, Seog‐Jin & Boram Park. (2017). List 3-dynamic coloring of graphs with small maximum average degree. Discrete Mathematics. 341(5). 1406–1418. 7 indexed citations
9.
Kim, Seog‐Jin & Boram Park. (2016). KneserグラフK(2k+r,k)の正方形の彩色. Graphs and Combinatorics. 32(4). 1472. 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.
Kim, Seog‐Jin & Boram Park. (2015). Coloring of the Square of Kneser Graph $$K(2k+r,k)$$ K ( 2 k + r , k ). Graphs and Combinatorics. 32(4). 1461–1472. 2 indexed citations
12.
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
13.
Kim, Seog‐Jin, et al.. (2013). Dynamic coloring and list dynamic coloring of planar graphs. Discrete Applied Mathematics. 161(13-14). 2207–2212. 34 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.
Kim, Seog‐Jin, et al.. (2013). Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. Journal of Graph Theory. 74(4). 369–391. 12 indexed citations
16.
Kim, Jon-Lark & Seog‐Jin Kim. (2011). The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes. Discrete Applied Mathematics. 159(18). 2222–2228. 4 indexed citations
17.
Cranston, Daniel W., Seog‐Jin Kim, & Gexin Yu. (2010). Injective colorings of sparse graphs. Discrete Mathematics. 310(21). 2965–2973. 25 indexed citations
18.
Kim, Suh-Ryung, et al.. (2009). The competition number of a graph with exactly two holes. Ars Combinatoria. 95. 3 indexed citations
19.
Kim, Seog‐Jin, et al.. (2007). Coloring the complements of intersection graphs of geometric figures. Discrete Mathematics. 308(20). 4589–4594. 2 indexed citations
20.
Kim, Seog‐Jin, et al.. (2006). Transversal numbers of translates of a convex body. Discrete Mathematics. 306(18). 2166–2173. 6 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

Breakdown of academic impact, for papers by Louis Esperet Breakdown of academic impact, for papers by Mirko Horňák Breakdown of academic impact, for papers by Arnfried Kemnitz Breakdown of academic impact, for papers by Robert Šámal Breakdown of academic impact, for papers by Sophie Spirkl Breakdown of academic impact, for papers by Marthe Bonamy Breakdown of academic impact, for papers by Alexandre Pinlou Breakdown of academic impact, for papers by Julia Böttcher Breakdown of academic impact, for papers by Edita Máčajová Breakdown of academic impact, for papers by Marietjie Frick
Rankless by CCL
2026