AbstractIt is known to be a hard problem to compute the competition number k(G) of a graph G in general. Park and Sano (in press) [16] gave the exact values of the competition numbers of Hamming graphs H(n,q) if 1≤n≤3 or 1≤q≤2. In this paper, we give an explicit formula for the competition numbers of ternary Hamming graphs
AbstractLet D be an acyclic digraph. The competition graph of D is a graph which has the same vertex...
AbstractGiven an acyclic digraph D, the competition graph C(D) is defined to be the undirected graph...
AbstractThe competition number k(G) of a graph G is the smallest number k such that G together with ...
AbstractIt is known to be a hard problem to compute the competition number k(G) of a graph G in gene...
AbstractFor a graph G, it is known to be a hard problem to compute the competition number k(G) of th...
AbstractIf D is an acyclic digraph, its competition graph is an undirected graph with the same verte...
AbstractThe competition graph of a digraph D is a graph which has the same vertex set as D and has a...
AbstractLet D be an acyclic digraph. The competition graph of D has the same set of vertices as D an...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractThe notion of the competition hypergraph was introduced as a variant of the notion of the co...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractThe competition graph C(D) of an acyclic digraph D is the graph with the same vertex set as ...
AbstractGiven an acyclic digraph D, the competition graph C(D) of D is the graph with the same verte...
AbstractThe competition graph of a digraph D is the graph which has the same vertex set as D and has...
AbstractIf D = (V, A>) is a digraph, its p-competition graph has vertex set V and an edge between x ...
AbstractLet D be an acyclic digraph. The competition graph of D is a graph which has the same vertex...
AbstractGiven an acyclic digraph D, the competition graph C(D) is defined to be the undirected graph...
AbstractThe competition number k(G) of a graph G is the smallest number k such that G together with ...
AbstractIt is known to be a hard problem to compute the competition number k(G) of a graph G in gene...
AbstractFor a graph G, it is known to be a hard problem to compute the competition number k(G) of th...
AbstractIf D is an acyclic digraph, its competition graph is an undirected graph with the same verte...
AbstractThe competition graph of a digraph D is a graph which has the same vertex set as D and has a...
AbstractLet D be an acyclic digraph. The competition graph of D has the same set of vertices as D an...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractThe notion of the competition hypergraph was introduced as a variant of the notion of the co...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractThe competition graph C(D) of an acyclic digraph D is the graph with the same vertex set as ...
AbstractGiven an acyclic digraph D, the competition graph C(D) of D is the graph with the same verte...
AbstractThe competition graph of a digraph D is the graph which has the same vertex set as D and has...
AbstractIf D = (V, A>) is a digraph, its p-competition graph has vertex set V and an edge between x ...
AbstractLet D be an acyclic digraph. The competition graph of D is a graph which has the same vertex...
AbstractGiven an acyclic digraph D, the competition graph C(D) is defined to be the undirected graph...
AbstractThe competition number k(G) of a graph G is the smallest number k such that G together with ...
DOI
Add to ORKG