(i, j) competition graphs. - Kim A. S. Hefner; Kathryn Fraughnaugh Jones; Suh-Ryung Kim; J. Richard Lundgren; Fred S. Roberts (Discret. Appl. Math., 1991)

2-Competition Graphs. - Garth Isaak; Suh-Ryung Kim; Terry A. McKee; Fred R. McMorris; Fred S. Roberts (SIAM J. Discret. Math., 1992)

p-Competition Numbers. - Suh-Ryung Kim; Terry A. McKee; Fred R. McMorris; Fred S. Roberts (Discret. Appl. Math., 1993)

Competition Numbers of Graphs with a Small Number of Triangles. - Suh-Ryung Kim; Fred S. Roberts (Discret. Appl. Math., 1997)

The Elimination Procedure for the Competition Number. - Suh-Ryung Kim; Fred S. Roberts (Ars Comb., 1998)

On the Inequality dk(G) <= k(G) + 1. - Suh-Ryung Kim (Ars Comb., 1999)

The m-step competition graph of a digraph. - Han Hyuk Cho; Suh-Ryung Kim; Yunsun Nam (Discret. Appl. Math., 2000)

Two families of graphs that are not CCE-orientable. - David C. Fisher; Suh-Ryung Kim; Chang Hoon Park; Yunsun Nam (Ars Comb., 2001)

Competition graphs of semiorders and the conditions C(p) and C*(p). - Suh-Ryung Kim; Fred S. Roberts (Ars Comb., 2002)

Domination graphs of regular tournaments. - Han Hyuk Cho; Suh-Ryung Kim; J. Richard Lundgren (Discret. Math., 2002)

Graphs satisfying inequality Theta(G2)leq Theta(G). - Ilwon Kang; Suh-Ryung Kim; Yangmi Shin; Yunsun Nam (Discret. Math., 2002)

On The Trees Whose 2-Step Competition Numbers Are Two. - Han Hyuk Cho; Suh-Ryung Kim; Yunsun Nam (Ars Comb., 2005)

A class of acyclic digraphs with interval competition graphs. - Han Hyuk Cho; Suh-Ryung Kim (Discret. Appl. Math., 2005)

The competition number of a graph having exactly one hole. - Han Hyuk Cho; Suh-Ryung Kim (Discret. Math., 2005)

On Super Edge-Magic Graphs. - Suh-Ryung Kim; Ji Yeon Park (Ars Comb., 2006)

On the graph inequality thetaE(G) geq thetaE(Gm). - Han Hyuk Cho; Suh-Ryung Kim; Jung Yeun Lee (Discret. Math., 2006)

On CCE graphs of doubly partial orders. - Seog-Jin Kim; Suh-Ryung Kim; Yoomi Rho (Discret. Appl. Math., 2007)

The competition numbers of complete tripartite graphs. - Suh-Ryung Kim; Yoshio Sano (Discret. Appl. Math., 2008)

Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p). - Jung Yeun Lee; Suh-Ryung Kim (Ars Comb., 2009)

The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. - Boram Park; Suh-Ryung Kim; Yoshio Sano (Discret. Math., 2009)

The competition number of a graph with exactly two holes. - Jung Yeun Lee; Suh-Ryung Kim; Seog-Jin Kim; Yoshio Sano (Ars Comb., 2010)

The competition number of a graph whose holes do not overlap much. - Suh-Ryung Kim; Jung Yeun Lee; Yoshio Sano (Discret. Appl. Math., 2010)

The competition numbers of Johnson graphs. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discuss. Math. Graph Theory, 2010)

Graphs having many holes but with small competition numbers. - Jung Yeun Lee; Suh-Ryung Kim; Seog-Jin Kim; Yoshio Sano (Appl. Math. Lett., 2011)

The m-step competition graphs of doubly partial orders. - Boram Park; Jung Yeun Lee; Suh-Ryung Kim (Appl. Math. Lett., 2011)

The competition number of a graph and the dimension of its hole space. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Appl. Math. Lett., 2012)

A Dice Rolling Game on a Set of Tori. - Jeehoon Kang; Suh-Ryung Kim; Boram Park (Electron. J. Comb., 2012)

The competition numbers of complete multipartite graphs with many partite sets. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discret. Appl. Math., 2012)

On Opsut's conjecture for hypercompetition numbers of hypergraphs. - Boram Park; Suh-Ryung Kim (Discret. Appl. Math., 2012)

Graph Equation for Line Graphs and m-Step Graphs. - Seog-Jin Kim; Suh-Ryung Kim; Jung Yeun Lee; Won-Jin Park; Yoshio Sano (Graphs Comb., 2012)

The competition number of the complement of a cycle. - Suh-Ryung Kim; Boram Park; Yoshio Sano (Discret. Appl. Math., 2013)

On the cores of games arising from integer edge covering functions of graphs. - Boram Park; Suh-Ryung Kim; Hye Kyung Kim (J. Comb. Optim., 2013)

The competition hypergraphs of doubly partial orders. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Discret. Appl. Math., 2014)

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., 2015)

Comparisons of linkage disequilibrium blocks of different populations at the sites of natural selection. - Sun-Ah Kim; Suh-Ryung Kim; Yun Joo Yoo (BIBM, 2016)

On the competition graphs of d-partial orders. - Jihoon Choi; Kyeong Seok Kim; Suh-Ryung Kim; Jung Yeun Lee; Yoshio Sano (Discret. Appl. Math., 2016)

The competition graphs of oriented complete bipartite graphs. - Suh-Ryung Kim; Jung Yeun Lee; Boram Park; Yoshio Sano (Discret. Appl. Math., 2016)

Topological properties of protein interaction network and phylogenetic age of proteins. - Hyeonseong Jeon; Suh-Ryung Kim; Yun Joo Yoo (BIBM, 2017)

On (1, 2)-step competition graphs of bipartite tournaments. - Jihoon Choi; Soogang Eoh; Suh-Ryung Kim; Sojung Lee (Discret. Appl. Math., 2017)

On the partial order competition dimensions of chordal graphs. - Jihoon Choi; Suh-Ryung Kim; Jung Yeun Lee; Yoshio Sano (Discret. Appl. Math., 2017)

On the phylogeny graphs of degree-bounded digraphs. - Seung Chul Lee; Jihoon Choi; Suh-Ryung Kim; Yoshio Sano (Discret. Appl. Math., 2017)

Analysis of triangular motifs in protein interaction networks and their implications to protein ages and cancer genes. - Hyeonseong Jeon; Suh-Ryung Kim; Dougu Nam; Yun Joo Yoo (Int. J. Data Min. Bioinform., 2017)

Comparisons of linkage disequilibrium blocks of different populations for positive selection. - Sun-Ah Kim; Suh-Ryung Kim; Yun Joo Yoo (Int. J. Data Min. Bioinform., 2017)

On consecutive edge magic total labelings of connected bipartite graphs. - Bumtle Kang; Suh-Ryung Kim; Ji Yeon Park (J. Comb. Optim., 2017)

On safe sets of the Cartesian product of two complete graphs. - Bumtle Kang; Suh-Ryung Kim; Boram Park (Ars Comb., 2018)

A new haplotype block detection method for dense genome sequencing data based on interval graph modeling of clusters of highly correlated SNPs. - Sun-Ah Kim; Chang-Sung Cho; Suh-Ryung Kim; Shelley B. Bull; Yun Joo Yoo (Bioinform., 2018)

A graph with the partial order competition dimension greater than five. - Jihoon Choi; Soogang Eoh; Suh-Ryung Kim (Discret. Appl. Math., 2019)

The partial order competition dimensions of bipartite graphs. - Jihoon Choi; Soogang Eoh; Suh-Ryung Kim; Jung Yeun Lee; Yoshio Sano (Discret. Appl. Math., 2019)

On the minimum clique partitioning problem on weighted chordal graphs. - Changseong Jo; Jihoon Choi; Suh-Ryung Kim; Yoshio Sano (Theor. Comput. Sci., 2019)

The niche graphs of bipartite tournaments. - Soogang Eoh; Jihoon Choi; Suh-Ryung Kim; Miok Oh (Discret. Appl. Math., 2020)

On m-step competition graphs of bipartite tournaments. - Soogang Eoh; Suh-Ryung Kim; Hyesun Yoon (Discret. Appl. Math., 2020)

Counting independent sets in Riordan graphs. - Gi-Sang Cheon; Ji-Hwan Jung; Bumtle Kang; Hana Kim; Suh-Ryung Kim; Sergey Kitaev; Seyed Ahmad Mojallal (Discret. Math., 2020)

On chordal phylogeny graphs. - Soogang Eoh; Suh-Ryung Kim (Discret. Appl. Math., 2021)

Competitively orientable complete multipartite graphs. - Myungho Choi; Minki Kwak; Suh-Ryung Kim (Discret. Math., 2022)

Structural properties of Toeplitz graphs. - Seyed Ahmad Mojallal; Ji-Hwan Jung; Gi-Sang Cheon; Suh-Ryung Kim; Bumtle Kang (Discret. Math., 2022)

The niche graphs of multipartite tournaments. - Soogang Eoh; Myungho Choi; Suh-Ryung Kim (Discuss. Math. Graph Theory, 2023)

Digraphs whose m-step competition graphs are trees. - Myungho Choi; Suh-Ryung Kim (Discret. Appl. Math., 2023)

On the limit of the sequence {Cm(D)}m=1∞ for a multipartite tournament D. - Ji-Hwan Jung; Suh-Ryung Kim; Hyesun Yoon (Discret. Appl. Math., 2023)

Extensions of results on phylogeny graphs of degree bounded digraphs. - Myungho Choi; Suh-Ryung Kim (Discret. Appl. Math., 2024)

A complete analysis of the convergence of Cm(D)m=1∞ for a multipartite tournament D. - Ji-Hwan Jung; Suh-Ryung Kim; Hyesun Yoon (Discret. Appl. Math., 2024)

Competition graphs of degree bounded digraphs. - Hojin Chu; Suh-Ryung Kim (Discret. Appl. Math., 2024)

The phylogeny number of a graph in the aspect of its triangles and diamonds. - Soogang Eoh; Suh-Ryung Kim; Hojun Lee (Discret. Appl. Math., 2025)

A digraph version of the Friendship Theorem. - Myungho Choi; Hojin Chu; Suh-Ryung Kim (Discret. Math., 2025)

Digraphs in which every t vertices have exactly λ common out-neighbors. - Myungho Choi; Hojin Chu; Suh-Ryung Kim (Discret. Math., 2025)

The triangle-free graphs that are competition graphs of multipartite tournaments. - Myungho Choi; Minki Kwak; Suh-Ryung Kim (Discuss. Math. Graph Theory, 2025)