Let (X, B) be a lambda-fold block design with block size 4. If a path of length two is removed from each block of B the resulting collection of kites K is a partial lambda-fold kite system (X, K). If the deleted edges can be arranged into a collection of kites D, then (X, K boolean OR D) is a lambda-fold kite system [5]. Now for each block b is an element of B let {P-1(b), P-2(b), P-3(b)} be a partition of b into paths of length two and define for each i =1, 2, 3, sets K-i and D-i as follows: for each b is an element of B, put the kite b\P-i(b) in K-i and the two edges belonging to the path P-i(b) in D-i. If the edges in D-i can be arranged into a collection of kites D-i* then M-i = (X, K-i boolean OR D-i*) is a lambda-fold kite system, cal...
AbstractLet (X,B) be a (λKv,G1)-design and G2 a subgraph of G1. Define sets B(G2) and D(G1∖G2) as fo...
AbstractLet (W,C) be an m-cycle system of order n and let Ω⊂W,|Ω|=v<n. We say that a path design (Ω,...
An octagon quadrangle is the graph consisting of an 8-cycle $(x_1,x_2,\dots,x_8)$(x1,x2,…,x8) with t...
In this paper necessary and sufficient conditions are given for the metamorphosis of a lambda-fold K...
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...
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...
AbstractLet D be the triangle with an attached edge (i.e. D is the “kite”, a graph having vertices {...
A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fif...
Let B(k, λ) be the spectrum of integers n such that there exists a Sλ(2, k, n), a balanced incomplet...
[[abstract]]A kite-design of order n is a decomposition of the complete graph Kn into kites. Such sy...
If an edge-disjoint decomposition of a complete graph of order n into copies of a 3-star (i.e., the ...
Let (W, C) beanm-cycle system of order n and let Ω ⊂ W, |Ω | = v<n. We say that a path design (Ω...
AbstractLet (X,B) be a (λKv,G1)-design and G2 a subgraph of G1. Define sets B(G2) and D(G1∖G2) as fo...
AbstractLet (W,C) be an m-cycle system of order n and let Ω⊂W,|Ω|=v<n. We say that a path design (Ω,...
An octagon quadrangle is the graph consisting of an 8-cycle $(x_1,x_2,\dots,x_8)$(x1,x2,…,x8) with t...
In this paper necessary and sufficient conditions are given for the metamorphosis of a lambda-fold K...
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...
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...
AbstractLet D be the triangle with an attached edge (i.e. D is the “kite”, a graph having vertices {...
A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fif...
Let B(k, λ) be the spectrum of integers n such that there exists a Sλ(2, k, n), a balanced incomplet...
[[abstract]]A kite-design of order n is a decomposition of the complete graph Kn into kites. Such sy...
If an edge-disjoint decomposition of a complete graph of order n into copies of a 3-star (i.e., the ...
Let (W, C) beanm-cycle system of order n and let Ω ⊂ W, |Ω | = v<n. We say that a path design (Ω...
AbstractLet (X,B) be a (λKv,G1)-design and G2 a subgraph of G1. Define sets B(G2) and D(G1∖G2) as fo...
AbstractLet (W,C) be an m-cycle system of order n and let Ω⊂W,|Ω|=v<n. We say that a path design (Ω,...
An octagon quadrangle is the graph consisting of an 8-cycle $(x_1,x_2,\dots,x_8)$(x1,x2,…,x8) with t...