1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2011
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…
math.CO2011★ 1 cited
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…