12 citations · 60 across the 50 of their papers we have counts for
5 papers · 1 filter
Competitively tight graphs
Suh-Ryung Kim, Jung Yeun Lee, Boram Park +1
The competition graph of a digraph is a (simple undirected) graph which has the same vertex set as and has an edge between two distinct vertices and if and only if…
The competition hypergraphs of doubly partial orders
Suh-Ryung Kim, Jung Yeun Lee, Boram Park +1
Since Cho and Kim (2005) showed that the competition graph of a doubly partial order is an interval graph, it has been actively studied whether or not the same phenomenon occurs fo…
Holes and a chordal cut in a graph
Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano
A set of vertices of a graph is called a {\em clique cut} of if the subgraph of induced by is a complete graph and the number of connected components of i…
The competition number of a graph and the dimension of its hole space
Suh-Ryung Kim, Jung Yeun Lee, Boram Park +1
The competition graph of a digraph D is a (simple undirected) 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 s…
The competition number of a graph in which any two holes share at most one edge
Jung Yeun Lee, Suh-Ryung Kim, Yoshio Sano
The competition graph of a digraph D is a (simple undirected) 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 s…