default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeog-Jin Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Seog-Jin Kim
, Xiaopan Lian:
The square of every subcubic planar graph of girth at least 6 is 7-choosable. Discret. Math. 347(6): 113963 (2024)- 2022
- [j41]Toshiki Abe, Seog-Jin Kim, Kenta Ozeki:
The Alon-Tarsi number of K5-minor-free graphs. Discret. Math. 345(4): 112764 (2022) - [j40]Seog-Jin Kim, Xiaowei Yu:
Planar graphs without intersecting 5-cycles are signed-4-choosable. Discret. Math. Algorithms Appl. 14(5): 2150151:1-2150151:10 (2022) - [j39]Ringi Kim, Seog-Jin Kim, Xuding Zhu:
Signed colouring and list colouring of k-chromatic graphs. J. Graph Theory 99(4): 637-650 (2022) - 2021
- [j38]Ruijuan Gu, Seog-Jin Kim, Yulai Ma, Yongtang Shi:
On list 3-dynamic coloring of near-triangulations. Discret. Appl. Math. 288: 87-90 (2021) - 2020
- [j37]Seog-Jin Kim, Alexandr V. Kostochka, Xuer Li, Xuding Zhu:
On-line DP-coloring of graphs. Discret. Appl. Math. 285: 443-453 (2020) - [j36]Seog-Jin Kim, Runrun Liu, Gexin Yu:
Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discret. Math. 343(8): 111714 (2020) - [j35]Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka, Suil O:
The minimum spectral radius of Kr+1-saturated graphs. Discret. Math. 343(11): 112068 (2020) - [j34]Jun Zhao, Sung-Bum Kim, Seog-Jin Kim, Hyoung-Moon Kim:
Simple New Proofs of the Characteristic Functions of the F and Skew-Normal Distributions. Symmetry 12(12): 2041 (2020)
2010 – 2019
- 2019
- [j33]Hervé Hocquard, Seog-Jin Kim, Théo Pierron:
Coloring squares of graphs with mad constraints. Discret. Appl. Math. 271: 64-73 (2019) - [j32]Seog-Jin Kim, Xiaowei Yu:
Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable. Graphs Comb. 35(3): 707-718 (2019) - [j31]Seog-Jin Kim, Kenta Ozeki:
A note on a Brooks' type theorem for DP?coloring. J. Graph Theory 91(2): 148-161 (2019) - 2018
- [j30]Seog-Jin Kim, Boram Park:
List 3-dynamic coloring of graphs with small maximum average degree. Discret. Math. 341(5): 1406-1418 (2018) - [j29]Seog-Jin Kim, Kenta Ozeki:
A sufficient condition for DP-4-colorability. Discret. Math. 341(7): 1983-1986 (2018) - [j28]Yoshihiro Asayama, Yuki Kawasaki, Seog-Jin Kim, Atsuhiro Nakamoto, Kenta Ozeki:
3-dynamic coloring of planar triangulations. Discret. Math. 341(11): 2988-2994 (2018) - [j27]Ringi Kim, Seog-Jin Kim, Jie Ma, Boram Park:
Cycles with two blocks in k-chromatic digraphs. J. Graph Theory 88(4): 592-605 (2018) - 2017
- [j26]Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. J. Comb. Theory B 122: 741-756 (2017) - 2016
- [j25]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) - [j24]Seog-Jin Kim, Boram Park:
Coloring of the Square of Kneser Graph K(2k+r, k). Graphs Comb. 32(4): 1461-1472 (2016) - 2015
- [j23]Seog-Jin Kim, Boram Park:
Bipartite Graphs whose Squares are not Chromatic-Choosable. Electron. J. Comb. 22(1): 1 (2015) - [j22]Seog-Jin Kim, Young Soo Kwon, Boram Park:
Chromatic-choosability of the power of graphs. Discret. Appl. Math. 180: 120-125 (2015) - [j21]Seog-Jin Kim, Boram Park:
Counterexamples to the List Square Coloring Conjecture. J. Graph Theory 78(4): 239-247 (2015) - 2014
- [j20]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
- [j19]Seog-Jin Kim, Won-Jin Park:
Injectively (Δ+1)-choosable graphs. Ars Comb. 112: 449-458 (2013) - [j18]Seog-Jin Kim, Sangjune Lee, Won-Jin Park:
Dynamic coloring and list dynamic coloring of planar graphs. Discret. Appl. Math. 161(13-14): 2207-2212 (2013) - [j17]Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, Xuding Zhu:
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. J. Graph Theory 74(4): 369-391 (2013) - 2012
- [j16]Seog-Jin Kim, Young Soo Kwon, Daphne Der-Fen Liu, Xuding Zhu:
On-Line List Colouring of Complete Multipartite Graphs. Electron. J. Comb. 19(1): 41 (2012) - [j15]Seog-Jin Kim, Suh-Ryung Kim, Jung Yeun Lee, Won-Jin Park, Yoshio Sano:
Graph Equation for Line Graphs and m-Step Graphs. Graphs Comb. 28(6): 831-842 (2012) - 2011
- [j14]Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective Colorings of Graphs with Low Average Degree. Algorithmica 60(3): 553-568 (2011) - [j13]Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano:
Graphs having many holes but with small competition numbers. Appl. Math. Lett. 24(8): 1331-1335 (2011) - [j12]Jon-Lark Kim, Seog-Jin Kim:
The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes. Discret. Appl. Math. 159(18): 2222-2228 (2011) - [c1]Seog-Jin Kim, Won-Jin Park:
List Dynamic Coloring of Sparse Graphs. COCOA 2011: 156-162 - 2010
- [j11]Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano:
The competition number of a graph with exactly two holes. Ars Comb. 95 (2010) - [j10]Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective colorings of sparse graphs. Discret. Math. 310(21): 2965-2973 (2010) - [i1]Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective colorings of graphs with low average degree. CoRR abs/1006.3776 (2010)
2000 – 2009
- 2008
- [j9]Seog-Jin Kim, Kittikorn Nakprasit:
Coloring the complements of intersection graphs of geometric figures. Discret. Math. 308(20): 4589-4594 (2008) - [j8]Seog-Jin Kim, Douglas B. West:
Triangle-free planar graphs with minimum degree 3 have radius at least 3. Discuss. Math. Graph Theory 28(3): 563-566 (2008) - [j7]Daniel W. Cranston, Seog-Jin Kim:
List-coloring the square of a subcubic graph. J. Graph Theory 57(1): 65-87 (2008) - 2007
- [j6]Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho:
On CCE graphs of doubly partial orders. Discret. Appl. Math. 155(8): 971-978 (2007) - 2006
- [j5]Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan:
Transversal numbers of translates of a convex body. Discret. Math. 306(18): 2166-2173 (2006) - 2004
- [j4]Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit:
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane. Electron. J. Comb. 11(1) (2004) - [j3]Seog-Jin Kim, Kittikorn Nakprasit:
On the Chromatic Number of the Square of the Kneser Graph K(2 k+1, k). Graphs Comb. 20(1): 79-90 (2004) - [j2]Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West:
Homomorphisms from sparse graphs with large girth. J. Comb. Theory B 90(1): 147-159 (2004) - 2003
- [j1]Tao Jiang, Seog-Jin Kim, Douglas B. West:
Isometric cycles, cutsets, and crowning of bridged graphs. J. Graph Theory 43(3): 161-170 (2003)
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-06-10 21:21 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:
