14 citations · 21 across the 2 of their papers we have counts for
2 papers
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…