default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuh-Ryung Kim
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j60]Myungho Choi, Hojin Chu
, Suh-Ryung Kim:
A digraph version of the Friendship Theorem. Discret. Math. 348(1): 114238 (2025)- 2024
- [j59]Hojin Chu, Suh-Ryung Kim:
Competition graphs of degree bounded digraphs. Discret. Appl. Math. 343: 106-114 (2024) - [j58]Myungho Choi, Suh-Ryung Kim:
Extensions of results on phylogeny graphs of degree bounded digraphs. Discret. Appl. Math. 355: 30-45 (2024) - [j57]Ji-Hwan Jung, Suh-Ryung Kim, Hyesun Yoon:
A complete analysis of the convergence of Cm(D)m=1∞ for a multipartite tournament D. Discret. Appl. Math. 358: 344-357 (2024) - 2023
- [j56]Myungho Choi, Suh-Ryung Kim:
Digraphs whose m-step competition graphs are trees. Discret. Appl. Math. 338: 234-246 (2023) - [j55]Ji-Hwan Jung, Suh-Ryung Kim, Hyesun Yoon:
On the limit of the sequence {Cm(D)}m=1∞ for a multipartite tournament D. Discret. Appl. Math. 340: 1-13 (2023) - [j54]Soogang Eoh, Myungho Choi, Suh-Ryung Kim:
The niche graphs of multipartite tournaments. Discuss. Math. Graph Theory 43(4): 1123-1146 (2023) - 2022
- [j53]Myungho Choi, Minki Kwak, Suh-Ryung Kim:
Competitively orientable complete multipartite graphs. Discret. Math. 345(9): 112950 (2022) - [j52]Seyed Ahmad Mojallal, Ji-Hwan Jung, Gi-Sang Cheon, Suh-Ryung Kim, Bumtle Kang:
Structural properties of Toeplitz graphs. Discret. Math. 345(11): 113016 (2022) - 2021
- [j51]Soogang Eoh, Suh-Ryung Kim:
On chordal phylogeny graphs. Discret. Appl. Math. 302: 80-91 (2021) - 2020
- [j50]Soogang Eoh, Jihoon Choi, Suh-Ryung Kim, Miok Oh:
The niche graphs of bipartite tournaments. Discret. Appl. Math. 282: 86-95 (2020) - [j49]Soogang Eoh, Suh-Ryung Kim, Hyesun Yoon:
On m-step competition graphs of bipartite tournaments. Discret. Appl. Math. 283: 199-206 (2020) - [j48]Gi-Sang Cheon, Ji-Hwan Jung, Bumtle Kang, Hana Kim, Suh-Ryung Kim, Sergey Kitaev, Seyed Ahmad Mojallal:
Counting independent sets in Riordan graphs. Discret. Math. 343(11): 112043 (2020)
2010 – 2019
- 2019
- [j47]Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
The partial order competition dimensions of bipartite graphs. Discret. Appl. Math. 254: 47-55 (2019) - [j46]Jihoon Choi, Soogang Eoh, Suh-Ryung Kim:
A graph with the partial order competition dimension greater than five. Discret. Appl. Math. 260: 262-266 (2019) - [j45]Changseong Jo, Jihoon Choi, Suh-Ryung Kim, Yoshio Sano:
On the minimum clique partitioning problem on weighted chordal graphs. Theor. Comput. Sci. 791: 1-9 (2019) - 2018
- [j44]Bumtle Kang, Suh-Ryung Kim, Boram Park:
On safe sets of the Cartesian product of two complete graphs. Ars Comb. 141: 243-257 (2018) - [j43]Sun-Ah Kim, Chang-Sung Cho, Suh-Ryung Kim, Shelley B. Bull, Yun Joo Yoo:
A new haplotype block detection method for dense genome sequencing data based on interval graph modeling of clusters of highly correlated SNPs. Bioinform. 34(3): 388-397 (2018) - 2017
- [j42]Jihoon Choi, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
On the partial order competition dimensions of chordal graphs. Discret. Appl. Math. 222: 89-96 (2017) - [j41]Jihoon Choi, Soogang Eoh, Suh-Ryung Kim, Sojung Lee:
On (1, 2)-step competition graphs of bipartite tournaments. Discret. Appl. Math. 232: 107-115 (2017) - [j40]Seung Chul Lee, Jihoon Choi, Suh-Ryung Kim, Yoshio Sano:
On the phylogeny graphs of degree-bounded digraphs. Discret. Appl. Math. 233: 83-93 (2017) - [j39]Sun-Ah Kim, Suh-Ryung Kim, Yun Joo Yoo:
Comparisons of linkage disequilibrium blocks of different populations for positive selection. Int. J. Data Min. Bioinform. 17(4): 293-310 (2017) - [j38]Hyeonseong Jeon, Suh-Ryung Kim, Dougu Nam, Yun Joo Yoo:
Analysis of triangular motifs in protein interaction networks and their implications to protein ages and cancer genes. Int. J. Data Min. Bioinform. 19(4): 340-365 (2017) - [j37]Bumtle Kang, Suh-Ryung Kim, Ji Yeon Park:
On consecutive edge magic total labelings of connected bipartite graphs. J. Comb. Optim. 33(1): 13-27 (2017) - [c2]Hyeonseong Jeon, Suh-Ryung Kim, Yun Joo Yoo:
Topological properties of protein interaction network and phylogenetic age of proteins. BIBM 2017: 1761-1768 - 2016
- [j36]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) - [j35]Jihoon Choi, Kyeong Seok Kim, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
On the competition graphs of d-partial orders. Discret. Appl. Math. 204: 29-37 (2016) - [c1]Sun-Ah Kim, Suh-Ryung Kim, Yun Joo Yoo:
Comparisons of linkage disequilibrium blocks of different populations at the sites of natural selection. BIBM 2016: 1757-1762 - 2015
- [j34]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) - 2014
- [j33]Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
The competition hypergraphs of doubly partial orders. Discret. Appl. Math. 165: 185-191 (2014) - 2013
- [j32]Suh-Ryung Kim, Boram Park, Yoshio Sano:
The competition number of the complement of a cycle. Discret. Appl. Math. 161(12): 1755-1760 (2013) - [j31]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) - 2012
- [j30]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) - [j29]Jeehoon Kang, Suh-Ryung Kim, Boram Park:
A Dice Rolling Game on a Set of Tori. Electron. J. Comb. 19(1): 54 (2012) - [j28]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) - [j27]Boram Park, Suh-Ryung Kim:
On Opsut's conjecture for hypercompetition numbers of hypergraphs. Discret. Appl. Math. 160(15): 2286-2293 (2012) - [j26]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
- [j25]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) - [j24]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) - 2010
- [j23]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) - [j22]Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
The competition number of a graph whose holes do not overlap much. Discret. Appl. Math. 158(13): 1456-1460 (2010) - [j21]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
- [j20]Jung Yeun Lee, Suh-Ryung Kim:
Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p). Ars Comb. 93 (2009) - [j19]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) - 2008
- [j18]Suh-Ryung Kim, Yoshio Sano:
The competition numbers of complete tripartite graphs. Discret. Appl. Math. 156(18): 3522-3524 (2008) - 2007
- [j17]Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho:
On CCE graphs of doubly partial orders. Discret. Appl. Math. 155(8): 971-978 (2007) - 2006
- [j16]Suh-Ryung Kim, Ji Yeon Park:
On Super Edge-Magic Graphs. Ars Comb. 81 (2006) - [j15]Han Hyuk Cho, Suh-Ryung Kim, Jung Yeun Lee:
On the graph inequality thetaE(G) geq thetaE(Gm). Discret. Math. 306(8-9): 738-744 (2006) - 2005
- [j14]Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam:
On The Trees Whose 2-Step Competition Numbers Are Two. Ars Comb. 77 (2005) - [j13]Han Hyuk Cho, Suh-Ryung Kim:
A class of acyclic digraphs with interval competition graphs. Discret. Appl. Math. 148(2): 171-180 (2005) - [j12]Han Hyuk Cho, Suh-Ryung Kim:
The competition number of a graph having exactly one hole. Discret. Math. 303(1-3): 32-41 (2005) - 2002
- [j11]Suh-Ryung Kim, Fred S. Roberts:
Competition graphs of semiorders and the conditions C(p) and C*(p). Ars Comb. 63 (2002) - [j10]Ilwon Kang, Suh-Ryung Kim, Yangmi Shin, Yunsun Nam:
Graphs satisfying inequality Theta(G2)leq Theta(G). Discret. Math. 250(1-3): 259-264 (2002) - [j9]Han Hyuk Cho, Suh-Ryung Kim, J. Richard Lundgren:
Domination graphs of regular tournaments. Discret. Math. 252(1-3): 57-71 (2002) - 2001
- [j8]David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam:
Two families of graphs that are not CCE-orientable. Ars Comb. 58 (2001) - 2000
- [j7]Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam:
The m-step competition graph of a digraph. Discret. Appl. Math. 105(1-3): 115-127 (2000)
1990 – 1999
- 1999
- [j6]Suh-Ryung Kim:
On the Inequality dk(G) <= k(G) + 1. Ars Comb. 51 (1999) - 1998
- [j5]Suh-Ryung Kim, Fred S. Roberts:
The Elimination Procedure for the Competition Number. Ars Comb. 50 (1998) - 1997
- [j4]Suh-Ryung Kim, Fred S. Roberts:
Competition Numbers of Graphs with a Small Number of Triangles. Discret. Appl. Math. 78(1-3): 153-162 (1997) - 1993
- [j3]Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts:
p-Competition Numbers. Discret. Appl. Math. 46(1): 87-92 (1993) - 1992
- [j2]Garth Isaak, Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts:
2-Competition Graphs. SIAM J. Discret. Math. 5(4): 524-538 (1992) - 1991
- [j1]Kim A. S. Hefner, Kathryn Fraughnaugh Jones, Suh-Ryung Kim, J. Richard Lundgren, Fred S. Roberts:
(i, j) competition graphs. Discret. Appl. Math. 32(3): 241-262 (1991)
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:31 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:
