Suh-Ryung Kim

According to our database1, Suh-Ryung Kim authored at least 52 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Counting independent sets in Riordan graphs.
Discret. Math., 2020

On m-step competition graphs of bipartite tournaments.
Discret. Appl. Math., 2020

The niche graphs of bipartite tournaments.
Discret. Appl. Math., 2020

2019
On the minimum clique partitioning problem on weighted chordal graphs.
Theor. Comput. Sci., 2019

The partial order competition dimensions of bipartite graphs.
Discret. Appl. Math., 2019

A graph with the partial order competition dimension greater than five.
Discret. Appl. Math., 2019

2018
A new haplotype block detection method for dense genome sequencing data based on interval graph modeling of clusters of highly correlated SNPs.
Bioinform., 2018

On safe sets of the Cartesian product of two complete graphs.
Ars Comb., 2018

2017
On consecutive edge magic total labelings of connected bipartite graphs.
J. Comb. Optim., 2017

Comparisons of linkage disequilibrium blocks of different populations for positive selection.
Int. J. Data Min. Bioinform., 2017

Analysis of triangular motifs in protein interaction networks and their implications to protein ages and cancer genes.
Int. J. Data Min. Bioinform., 2017

On the phylogeny graphs of degree-bounded digraphs.
Discret. Appl. Math., 2017

On the partial order competition dimensions of chordal graphs.
Discret. Appl. Math., 2017

On (1, 2)-step competition graphs of bipartite tournaments.
Discret. Appl. Math., 2017

Topological properties of protein interaction network and phylogenetic age of proteins.
Proceedings of the 2017 IEEE International Conference on Bioinformatics and Biomedicine, 2017

2016
The competition graphs of oriented complete bipartite graphs.
Discret. Appl. Math., 2016

On the competition graphs of d-partial orders.
Discret. Appl. Math., 2016

Comparisons of linkage disequilibrium blocks of different populations at the sites of natural selection.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2015
A generalization of Opsut's result on the competition numbers of line graphs.
Discret. Appl. Math., 2015

2014
The competition hypergraphs of doubly partial orders.
Discret. Appl. Math., 2014

2013
On the cores of games arising from integer edge covering functions of graphs.
J. Comb. Optim., 2013

The competition number of the complement of a cycle.
Discret. Appl. Math., 2013

2012
Graph Equation for Line Graphs and m-Step Graphs.
Graphs Comb., 2012

On Opsut's conjecture for hypercompetition numbers of hypergraphs.
Discret. Appl. Math., 2012

The competition numbers of complete multipartite graphs with many partite sets.
Discret. Appl. Math., 2012

A Dice Rolling Game on a Set of Tori.
Electron. J. Comb., 2012

The competition number of a graph and the dimension of its hole space.
Appl. Math. Lett., 2012

2011
The m-step competition graphs of doubly partial orders.
Appl. Math. Lett., 2011

Graphs having many holes but with small competition numbers.
Appl. Math. Lett., 2011

2010
The competition numbers of Johnson graphs.
Discuss. Math. Graph Theory, 2010

The competition number of a graph whose holes do not overlap much.
Discret. Appl. Math., 2010

The competition number of a graph with exactly two holes.
Ars Comb., 2010

2009
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares.
Discret. Math., 2009

Competition Graphs of Acyclic Digraphs Satisfying Condition C*(p).
Ars Comb., 2009

2008
The competition numbers of complete tripartite graphs.
Discret. Appl. Math., 2008

2007
On CCE graphs of doubly partial orders.
Discret. Appl. Math., 2007

2006
On the graph inequality <i>theta</i><sub><i>E</i></sub>(<i>G</i>) geq <i>theta</i><sub><i>E</i></sub>(<i>G</i><sup><i>m</i></sup>).
Discret. Math., 2006

On Super Edge-Magic Graphs.
Ars Comb., 2006

2005
The competition number of a graph having exactly one hole.
Discret. Math., 2005

A class of acyclic digraphs with interval competition graphs.
Discret. Appl. Math., 2005

On The Trees Whose 2-Step Competition Numbers Are Two.
Ars Comb., 2005

2002
Graphs satisfying inequality Theta(G<sup>2</sup>)leq Theta(G).
Discret. Math., 2002

Domination graphs of regular tournaments.
Discret. Math., 2002

Competition graphs of semiorders and the conditions C(p) and C*(p).
Ars Comb., 2002

2001
Two families of graphs that are not CCE-orientable.
Ars Comb., 2001

2000
The m-step competition graph of a digraph.
Discret. Appl. Math., 2000

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

1998
The Elimination Procedure for the Competition Number.
Ars Comb., 1998

1997
Competition Numbers of Graphs with a Small Number of Triangles.
Discret. Appl. Math., 1997

1993
<i>p</i>-Competition Numbers.
Discret. Appl. Math., 1993

1992
2-Competition Graphs.
SIAM J. Discret. Math., 1992

1991
(i, j) competition graphs.
Discret. Appl. Math., 1991


  Loading...