Search the dblp DataBase

Publications of Author

1. Suh-Ryung Kim
   On the Inequality dk(G) <= k(G) + 1. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 1999, v:51, n:, pp:- [Journal]
   
2. Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam
   On The Trees Whose 2-Step Competition Numbers Are Two. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2005, v:77, n:, pp:- [Journal]
   
3. David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam
   Two families of graphs that are not CCE-orientable. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2001, v:58, n:, pp:- [Journal]
   
4. Suh-Ryung Kim, Fred S. Roberts
   Competition graphs of semiorders and the conditions C(p) and C*(p). [Citation Graph (0, 0)][DBLP]
   Ars Comb., 2002, v:63, n:, pp:- [Journal]
   
5. Suh-Ryung Kim, Fred S. Roberts
   The Elimination Procedure for the Competition Number. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 1998, v:50, n:, pp:- [Journal]
   
6. Han Hyuk Cho, Suh-Ryung Kim
   A class of acyclic digraphs with interval competition graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2005, v:148, n:2, pp:171-180 [Journal]
   
7. Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam
   The m-step competition graph of a digraph. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2000, v:105, n:1-3, pp:115-127 [Journal]
   
8. Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts
   p-Competition Numbers. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:46, n:1, pp:87-92 [Journal]
   
9. Suh-Ryung Kim, Fred S. Roberts
   Competition Numbers of Graphs with a Small Number of Triangles. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:153-162 [Journal]
   
10. Seog-Jin Kim, Suh-Ryung Kim, Yoomi Rho
    On CCE graphs of doubly partial orders. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:971-978 [Journal]
    
11. Han Hyuk Cho, Suh-Ryung Kim
    The competition number of a graph having exactly one hole. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:303, n:1-3, pp:32-41 [Journal]
    
12. Han Hyuk Cho, Suh-Ryung Kim, J. Richard Lundgren
    Domination graphs of regular tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:252, n:1-3, pp:57-71 [Journal]
    
13. Han Hyuk Cho, Suh-Ryung Kim, Jung Yeun Lee
    On the graph inequality theta_E(G) geq theta_E(G^m). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:8-9, pp:738-744 [Journal]
    
14. Ilwon Kang, Suh-Ryung Kim, Yangmi Shin, Yunsun Nam
    Graphs satisfying inequality Theta(G²)leq Theta(G). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:259-264 [Journal]
    
15. Garth Isaak, Suh-Ryung Kim, Terry A. McKee, Fred R. McMorris, Fred S. Roberts
    2-Competition Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:524-538 [Journal]
    
16. 
    On Super Edge-Magic Graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    The competition numbers of complete tripartite graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    (i, j) competition graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    The competition number of a graph whose holes do not overlap much. [Citation Graph (, )][DBLP]
    
    
20. 
    The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. [Citation Graph (, )][DBLP]