26 citations · 161 across the 33 of their papers we have counts for
5 papers · 1 filter
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…
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…
The niche graphs of doubly partial orders
Suh-Ryung Kim, Jung Yeun Lee, Boram Park +2
The competition graph of a doubly partial order is known to be an interval graph. The competition-common enemy graph of a doubly partial order is also known to be an interval graph…
Cycles and p-competition graphs
Suh-Ryung Kim, Boram Park, Yoshio Sano
The notion of p-competition graphs of digraphs was introduced by S-R. Kim, T. A. McKee, F. R. McMorris, and F. S. Roberts [p-competition graphs, Linear Algebra Appl., 217 (1995) 16…
The competition numbers of regular polyhedra
Yoshio Sano
The notion of a competition graph was introduced by J. E. Cohen in 1968. The competition graph C(D) of a digraph D is a (simple undirected) graph which has the same vertex set as D…