14 citations · 118 across the 38 of their papers we have counts for
5 papers · 2 filters
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…
The competition number of a generalized line graph is at most two
Boram Park, Yoshio Sano
In 1982, Opsut showed that the competition number of a line graph is at most two and gave a necessary and sufficient condition for the competition number of a line graph being one.…
The phylogeny graphs of doubly partial orders
Boram Park, Yoshio Sano
The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs 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…