14 citations · 118 across the 38 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
math.CO2010★ 13 cited
The competition numbers of Hamming graphs with diameter at most three
Boram Park, Yoshio Sano
The competition graph of a digraph 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 such that (x,v) and (…
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…