Let (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 (Yazc, 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 cycles, into...
© 2014 Elsevier B.V.All rights reserved. A k-cycle system of a multigraph G is an ordered pair (V,C)...
A bowtie is a closed trail whose graph consists of two 3-cycles with exactly one vertex in common. A...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
Let (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles can be pa...
AbstractLet (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles c...
If an edge-disjoint decomposition of a complete graph of order n into copies of a 3-star (i.e., the ...
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 ...
AbstractA Kt,t-design of order n is an edge-disjoint decomposition of Kn into copies of Kt,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...
Let (X, B) be a lambda-fold block design with block size 4. If a path of length two is removed from ...
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...
A 6-cycle system of a graph G is an edge-disjoint decomposition of G into 6-cycles. Graphs G, for wh...
Dedicated to Curt Lindner on the occasion of his 65th birthday Let Kn,n − I denote the complete bipa...
We describe a method which, in certain circumstances, may be used to prove that the well-known neces...
© 2014 Elsevier B.V.All rights reserved. A k-cycle system of a multigraph G is an ordered pair (V,C)...
A bowtie is a closed trail whose graph consists of two 3-cycles with exactly one vertex in common. A...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...
Let (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles can be pa...
AbstractLet (X,C) denote a twofold k-cycle system with an even number of cycles. If these k-cycles c...
If an edge-disjoint decomposition of a complete graph of order n into copies of a 3-star (i.e., the ...
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 ...
AbstractA Kt,t-design of order n is an edge-disjoint decomposition of Kn into copies of Kt,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...
Let (X, B) be a lambda-fold block design with block size 4. If a path of length two is removed from ...
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...
A 6-cycle system of a graph G is an edge-disjoint decomposition of G into 6-cycles. Graphs G, for wh...
Dedicated to Curt Lindner on the occasion of his 65th birthday Let Kn,n − I denote the complete bipa...
We describe a method which, in certain circumstances, may be used to prove that the well-known neces...
© 2014 Elsevier B.V.All rights reserved. A k-cycle system of a multigraph G is an ordered pair (V,C)...
A bowtie is a closed trail whose graph consists of two 3-cycles with exactly one vertex in common. A...
AbstractLet Kn,n−I denote the complete bipartite graph with n vertices in each part from which a 1-f...