A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that every class contains each vertex exactly α times. In this paper we study the existence problem of an α-resolvable λ-fold G-design oforder v in the case when G is any connected subgraph of K_4 and prove that the necessary conditions for its existence are also sufficient
AbstractA regular graph design RGD(v,k;r) is a design on v points with blocks of size k and constant...
AbstractA Kirkman school project design on v elements consists of the maximum admissible number of d...
AbstractA balanced incomplete block design (BIBD) B[k, λ;v] is an arrangement of v elements in block...
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that...
AbstractLet G be a graph. Then a G-decomposition of Kv, a complete graph on v vertices, is a pair Σ=...
In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$ minus ...
AbstractLet G be a graph [a digraph] and H be a subgraph of G. A D(G,H,λ) design is a multiset D of ...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
AbstractA resolvable (balanced) path design, RBPD(v, k, λ) is the decomposition of λ copies of the c...
AbstractGiven a graph G, a G-decomposition of the complete graph Kv is a set of graphs, all isomorph...
AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block...
A regular graph design RGD(υ, k; r) is a design on υ points with blocks of size k and constant repli...
AbstractSuppose Kv is the complete undirected graph with v vertices and G is a finite simple undirec...
AbstractThis is a survey on the existence of G-designs, bipartite G-designs and multipartite G-desig...
AbstractLet λ1Ka denote the graph on a vertices with λ1 edges between every pair of vertices. Take p...
AbstractA regular graph design RGD(v,k;r) is a design on v points with blocks of size k and constant...
AbstractA Kirkman school project design on v elements consists of the maximum admissible number of d...
AbstractA balanced incomplete block design (BIBD) B[k, λ;v] is an arrangement of v elements in block...
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that...
AbstractLet G be a graph. Then a G-decomposition of Kv, a complete graph on v vertices, is a pair Σ=...
In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$ minus ...
AbstractLet G be a graph [a digraph] and H be a subgraph of G. A D(G,H,λ) design is a multiset D of ...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
AbstractA resolvable (balanced) path design, RBPD(v, k, λ) is the decomposition of λ copies of the c...
AbstractGiven a graph G, a G-decomposition of the complete graph Kv is a set of graphs, all isomorph...
AbstractEach parallel class of a uniformly resolvable design (URD) contains blocks of only one block...
A regular graph design RGD(υ, k; r) is a design on υ points with blocks of size k and constant repli...
AbstractSuppose Kv is the complete undirected graph with v vertices and G is a finite simple undirec...
AbstractThis is a survey on the existence of G-designs, bipartite G-designs and multipartite G-desig...
AbstractLet λ1Ka denote the graph on a vertices with λ1 edges between every pair of vertices. Take p...
AbstractA regular graph design RGD(v,k;r) is a design on v points with blocks of size k and constant...
AbstractA Kirkman school project design on v elements consists of the maximum admissible number of d...
AbstractA balanced incomplete block design (BIBD) B[k, λ;v] is an arrangement of v elements in block...