8 citations · 50 across the 23 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009★ 8 cited
The competition number of a graph with exactly two holes
Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim +1
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 su…
math.CO2009★ 6 cited
Graphs having many holes but with small competition numbers
Jung Yeun Lee, Suh-Ryung Kim, Seog-Jin Kim +1
The competition number k(G) of a graph G is the smallest number k such that G together with k isolated vertices added is the competition graph of an acyclic digraph. A chordless cy…