#### Filter Results:

#### Publication Year

1991

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Han Hyuk Cho, Suh-Ryung Kim
- Discrete Applied Mathematics
- 2005

Let D be an acyclic digraph. The competition graph of D has the same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that (u, x) and (v, x) are arcs of D. In this paper, we show that the competition graphs of doubly partial orders are interval graphs. We also show that an interval graph together with… (More)

- Suh-Ryung Kim, Yoshio Sano
- Discrete Applied Mathematics
- 2008

For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition numbers of complete tripartite graphs.

- Han Hyuk Cho, Suh-Ryung Kim
- Discrete Mathematics
- 2005

- Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano
- Discrete Applied Mathematics
- 2010

- Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim, Yoshio Sano
- Ars Comb.
- 2010

Let D be an acyclic digraph. The competition graph of D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x, v) and (y, v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition… (More)

- Suh-Ryung Kim, Fred S. Roberts
- Ars Comb.
- 1998

- Jihoon Choi, Kyeong Seok Kim, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano
- Discrete Applied Mathematics
- 2016

- Suh-Ryung Kim, Fred S. Roberts
- Discrete Applied Mathematics
- 1997

- Han Hyuk Cho, Suh-Ryung Kim, J. Richard Lundgren
- Discrete Mathematics
- 2002

- Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam
- Discrete Applied Mathematics
- 2000

The competition graph of a digraph was introduced by Cohen in 1968 associated with the study of ecosystems. Since then, the competition graph has been widely studied and many variations have been introduced. In this paper, we deÿne and study the m-step competition graph of a digraph which is another generalization of competition graph. ? 2000 Elsevier… (More)