14 citations · 33 across the 3 of their papers we have counts for
3 papers
math.CO2010★ 12 cited
The competition-common enemy graphs of digraphs satisfying Conditions and
Yoshio Sano
S. -R. Kim and F. S. Roberts (2002) introduced the following conditions and for digraphs as generalizations of the condition for digraphs to be semiorders. The condi…
math.CO2010★ 14 cited
The competition numbers of ternary Hamming graphs
Boram Park, Yoshio Sano
It is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano [13] gave the exact values of the competition numbers of Hamming grap…
math.CO2010★ 7 cited
On the hypercompetition numbers of hypergraphs
Boram Park, Yoshio Sano
The competition hypergraph $C{\cH}(D)$ of a digraph is the hypergraph such that the vertex set is the same as and is a hyperedge if and only if conta…