<p>In 2010, Kim, Park and Sano studied the competition numbers of Johnson graphs. They gave the competition numbers of J(n,2) and J(n,3).</p><p>In this note, we consider the competition number of J(n,4).</p
AbstractGiven an acyclic digraph D, the competition graph C(D) of D is the graph with the same verte...
This graduation paper deals with the so-called J-graph family and two of its subfamilies, the Johnso...
AbstractSince Cohen introduced the competition graph in 1968, the competition graph has been studied...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractIt is known to be a hard problem to compute the competition number k(G) of a graph G in gene...
AbstractA hole of a graph G is an induced cycle of length at least 4. Kim (2005) [3] conjectured tha...
AbstractFor a graph G, it is known to be a hard problem to compute the competition number k(G) of th...
AbstractLet D be an acyclic digraph. The competition graph of D has the same set of vertices as D an...
AbstractThe competition number k(G) of a graph G is the smallest number k such that G together with ...
AbstractIf D = (V, A>) is a digraph, its p-competition graph has vertex set V and an edge between x ...
AbstractA hole of a graph is an induced cycle of length at least 4. Kim (2005) [2] conjectured that ...
AbstractThe competition graph C(D) of an acyclic digraph D is the graph with the same vertex set as ...
AbstractLet D be an acyclic digraph. The competition graph of D is a graph which has the same vertex...
AbstractThe competition graph of a digraph D is a graph which has the same vertex set as D and has a...
AbstractGiven an acyclic digraph D, the competition graph C(D) of D is the graph with the same verte...
This graduation paper deals with the so-called J-graph family and two of its subfamilies, the Johnso...
AbstractSince Cohen introduced the competition graph in 1968, the competition graph has been studied...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge b...
AbstractIt is known to be a hard problem to compute the competition number k(G) of a graph G in gene...
AbstractA hole of a graph G is an induced cycle of length at least 4. Kim (2005) [3] conjectured tha...
AbstractFor a graph G, it is known to be a hard problem to compute the competition number k(G) of th...
AbstractLet D be an acyclic digraph. The competition graph of D has the same set of vertices as D an...
AbstractThe competition number k(G) of a graph G is the smallest number k such that G together with ...
AbstractIf D = (V, A>) is a digraph, its p-competition graph has vertex set V and an edge between x ...
AbstractA hole of a graph is an induced cycle of length at least 4. Kim (2005) [2] conjectured that ...
AbstractThe competition graph C(D) of an acyclic digraph D is the graph with the same vertex set as ...
AbstractLet D be an acyclic digraph. The competition graph of D is a graph which has the same vertex...
AbstractThe competition graph of a digraph D is a graph which has the same vertex set as D and has a...
AbstractGiven an acyclic digraph D, the competition graph C(D) of D is the graph with the same verte...
This graduation paper deals with the so-called J-graph family and two of its subfamilies, the Johnso...
AbstractSince Cohen introduced the competition graph in 1968, the competition graph has been studied...
DOI
Add to ORKG