Add to ORKGIn this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$ minus a 1-factor $(K_v − I)$ into subgraphs where each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes consist of either 4-cycles or 3-stars
We consider Class-Uniformly Resolvable frames (CURFs), which are group divisible designs with partia...
AbstractWe study a method of Lonz and Vanstone which constructs an S3(3, 4, 2n) from any given 1-fac...
AbstractA resolvable (balanced) path design, RBPD(v, k, λ) is the decomposition of λ copies of the c...
In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$ minus ...
If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of...
In this paper we consider the uniformly resolvable decompositions of the complete graph $\lambda K_v...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
Let Kv denote the complete graph of order v and Kv - I denote Kv minus a 1-factor. In this article w...
In this paper, we consider uniformly resolvable decompositions of complete graph K-v( or K-v minus a...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
The notion of uniformity, as in uniform 1 -factorisations, extends naturally to graph decompositions...
AbstractLet λ1Ka denote the graph on a vertices with λ1 edges between every pair of vertices. Take p...
AbstractLet H be a fixed graph. An H -decomposition of Knis a coloring of the edges of Knsuch that e...
In this paper, we consider factorizations of complete graph $K_v$ into cycles and $1$--factors. We w...
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that...
We consider Class-Uniformly Resolvable frames (CURFs), which are group divisible designs with partia...
AbstractWe study a method of Lonz and Vanstone which constructs an S3(3, 4, 2n) from any given 1-fac...
AbstractA resolvable (balanced) path design, RBPD(v, k, λ) is the decomposition of λ copies of the c...
In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$ minus ...
If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of...
In this paper we consider the uniformly resolvable decompositions of the complete graph $\lambda K_v...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
Let Kv denote the complete graph of order v and Kv - I denote Kv minus a 1-factor. In this article w...
In this paper, we consider uniformly resolvable decompositions of complete graph K-v( or K-v minus a...
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the...
The notion of uniformity, as in uniform 1 -factorisations, extends naturally to graph decompositions...
AbstractLet λ1Ka denote the graph on a vertices with λ1 edges between every pair of vertices. Take p...
AbstractLet H be a fixed graph. An H -decomposition of Knis a coloring of the edges of Knsuch that e...
In this paper, we consider factorizations of complete graph $K_v$ into cycles and $1$--factors. We w...
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that...
We consider Class-Uniformly Resolvable frames (CURFs), which are group divisible designs with partia...
AbstractWe study a method of Lonz and Vanstone which constructs an S3(3, 4, 2n) from any given 1-fac...
AbstractA resolvable (balanced) path design, RBPD(v, k, λ) is the decomposition of λ copies of the c...