AbstractLet Kkd denote the Cartesian product of d copies of the complete graph Kk. We prove necessary and sufficient conditions for the existence of a Kkr-factorization of Kpns, where p is prime and k>1, n, r and s are positive integers
AbstractWe consider the computational complexity of recognizinf concerned cartesian product graphs. ...
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We impro...
AbstractIn this paper, for any prime p⩾11, we consider Cp-decompositions of Km×Kn and Km*K¯n and als...
Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary an...
We continue the study of complete factorisations of complete bipartite graphs of the form Kn,n by fa...
AbstractWe continue the study of complete factorisations of complete bipartite graphs of the form Kn...
AbstractWe study complete Kp,q-factorisations of Km,n. Simple necessary conditions are found and we ...
AbstractIt is shown that the necessary conditions mn ≡ 0 (mod k) and (m − 1)nk ≡ 0 (mod 2(k − 1)) fo...
AbstractLet Km,n be a complete bipartite graph with two partite sets having m and n vertices, respec...
AbstractLet t be a positive integer, and let K=(k1,…,kt) and L=(l1,…,lt) be collections of nonnegati...
AbstractIn this note we give a necessary and sufficient condition for factorization of graphs satisf...
AbstractIn this paper, it is shown that a necessary and sufficient condition for the existence of a ...
There are simple arithmetic conditions necessary for the complete bipartite graph Km;n to have a com...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
AbstractWe present a construction of tree factorizations of complete graphs and it also can be used ...
AbstractWe consider the computational complexity of recognizinf concerned cartesian product graphs. ...
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We impro...
AbstractIn this paper, for any prime p⩾11, we consider Cp-decompositions of Km×Kn and Km*K¯n and als...
Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary an...
We continue the study of complete factorisations of complete bipartite graphs of the form Kn,n by fa...
AbstractWe continue the study of complete factorisations of complete bipartite graphs of the form Kn...
AbstractWe study complete Kp,q-factorisations of Km,n. Simple necessary conditions are found and we ...
AbstractIt is shown that the necessary conditions mn ≡ 0 (mod k) and (m − 1)nk ≡ 0 (mod 2(k − 1)) fo...
AbstractLet Km,n be a complete bipartite graph with two partite sets having m and n vertices, respec...
AbstractLet t be a positive integer, and let K=(k1,…,kt) and L=(l1,…,lt) be collections of nonnegati...
AbstractIn this note we give a necessary and sufficient condition for factorization of graphs satisf...
AbstractIn this paper, it is shown that a necessary and sufficient condition for the existence of a ...
There are simple arithmetic conditions necessary for the complete bipartite graph Km;n to have a com...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
AbstractWe present a construction of tree factorizations of complete graphs and it also can be used ...
AbstractWe consider the computational complexity of recognizinf concerned cartesian product graphs. ...
AbstractLet the connected graph G be canonically embedded into a Cartesian product ∏i∈lG∗i. We impro...
AbstractIn this paper, for any prime p⩾11, we consider Cp-decompositions of Km×Kn and Km*K¯n and als...
DOI
Add to ORKG