AbstractLet (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles can be paired together so that: (i) each pair contains a common edge; (ii) removal of the repeated common edge from each pair leaves a (2k−2)-cycle; (iii) all the repeated edges, once removed, can be rearranged exactly into a collection of further (2k−2)-cycles; then this is a metamorphosis of a twofold k-cycle system into a twofold (2k−2)-cycle system. The existence of such metamorphoses has been dealt with for the case of 3-cycles (Gionfriddo and Lindner, 2003) [3] and 4-cycles (Yazıcı, 2005) [7].If a twofold k-cycle system (X,C) of order n exists, which has not just one but has k different metamorphoses, from k different pairings of its cyc...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
AbstractRecently, the spectrum problem for 2-perfectm-cycle systems has been studied by several auth...
AbstractWe construct a C(2m, 2m, 2) design which is a family of Hamilton cycles in K2m so that each ...
AbstractLet (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles c...
Let (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles can be pa...
If an edge-disjoint decomposition of a complete graph of order n into copies of a 3-star (i.e., the ...
AbstractA Kt,t-design of order n is an edge-disjoint decomposition of Kn into copies of Kt,t. When t...
A K-t,K-t-design of order n is an edge-disjoint decomposition of K-n into copies of K-t,K-t. When t ...
ii The graph is called a hinge. A hinge system of order n is a pair (X, H) where H is a collection o...
In this paper necessary and sufficient conditions are given for the metamorphosis of a lambda-fold K...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
Let (V,T) be a 3-fold triple system and (V,C) a 4-fold 4-cycle system on the same set V. This choice...
AbstractStarting from earliest papers by Rosa we solve, directly and explicitly, the existence probl...
Let (X, B) be a lambda-fold block design with block size 4. If a path of length two is removed from ...
AbstractSuppose H is a complete m-partite graph Km(n1,n2,…,nm) with vertex set V and m independent s...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
AbstractRecently, the spectrum problem for 2-perfectm-cycle systems has been studied by several auth...
AbstractWe construct a C(2m, 2m, 2) design which is a family of Hamilton cycles in K2m so that each ...
AbstractLet (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles c...
Let (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles can be pa...
If an edge-disjoint decomposition of a complete graph of order n into copies of a 3-star (i.e., the ...
AbstractA Kt,t-design of order n is an edge-disjoint decomposition of Kn into copies of Kt,t. When t...
A K-t,K-t-design of order n is an edge-disjoint decomposition of K-n into copies of K-t,K-t. When t ...
ii The graph is called a hinge. A hinge system of order n is a pair (X, H) where H is a collection o...
In this paper necessary and sufficient conditions are given for the metamorphosis of a lambda-fold K...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
Let (V,T) be a 3-fold triple system and (V,C) a 4-fold 4-cycle system on the same set V. This choice...
AbstractStarting from earliest papers by Rosa we solve, directly and explicitly, the existence probl...
Let (X, B) be a lambda-fold block design with block size 4. If a path of length two is removed from ...
AbstractSuppose H is a complete m-partite graph Km(n1,n2,…,nm) with vertex set V and m independent s...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
AbstractRecently, the spectrum problem for 2-perfectm-cycle systems has been studied by several auth...
AbstractWe construct a C(2m, 2m, 2) design which is a family of Hamilton cycles in K2m so that each ...