AbstractLet G be a graph [a digraph] and H be a subgraph of G. A D(G,H,λ) design is a multiset D of subgraphs of G each isomorphic to H so that every 2-path [directed 2-path] of G lies in exactly λ subgraphs in D. In this paper, we show that there exists a D(Kn,n,C4,λ) design if and only if (i) n is even, or (ii) n is odd and λ is even. We also show that there exists a D(Kn,n∗,C⃗4,λ) design for every n and λ, where Kn,n and Kn,n∗ are the complete bipartite graph and the complete bipartite digraph, respectively; C4 and C⃗4 are a 4-cycle and a directed 4-cycle, respectively
AbstractLet H be a graph having λ edges which has no loops and multiple edges. Complete results abou...
AbstractA resolvable (balanced) path design, RBPD(v, k, λ) is the decomposition of λ copies of the c...
AbstractAn even cycle decomposition of a graph is a partition of its edge into even cycles. We first...
Let G be a graph [a digraph] and H be a subgraph of G. A D(G,H,λ) design is a multiset D of subgraph...
AbstractLet G be a graph [a digraph] and H be a subgraph of G. A D(G,H,λ) design is a multiset D of ...
AbstractLet λ1Ka denote the graph on a vertices with λ1 edges between every pair of vertices. Take p...
AbstractIn this paper we give necessary and sufficient conditions for the existence of an exact cove...
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that...
AbstractWe construct a C(2m, 2m, 2) design which is a family of Hamilton cycles in K2m so that each ...
For k ⩾ 2 the complete multigraph λKn has a factorization into isomorphic spanning subgraphs, each c...
AbstractLet G be the set that contains precisely the graphs on n vertices with maximum degree 3 for ...
Let λ K denote the graph on a vertices with λ edges between every pair of vertices. Take p copies of...
We prove that for every $n$, there is a graph $G$ with $\chi(G) \geq n$ and $\omega(G) \leq 3$ such ...
AbstractA 4-graph is odd if its vertex set can be partitioned into two sets so that every edge inter...
AbstractLet J be a set of positive integers. Suppose m>1 and H is a complete m-partite graph with ve...
AbstractLet H be a graph having λ edges which has no loops and multiple edges. Complete results abou...
AbstractA resolvable (balanced) path design, RBPD(v, k, λ) is the decomposition of λ copies of the c...
AbstractAn even cycle decomposition of a graph is a partition of its edge into even cycles. We first...
Let G be a graph [a digraph] and H be a subgraph of G. A D(G,H,λ) design is a multiset D of subgraph...
AbstractLet G be a graph [a digraph] and H be a subgraph of G. A D(G,H,λ) design is a multiset D of ...
AbstractLet λ1Ka denote the graph on a vertices with λ1 edges between every pair of vertices. Take p...
AbstractIn this paper we give necessary and sufficient conditions for the existence of an exact cove...
A λ-fold G-design is said to be α-resolvable if its blocks can be partitioned into classes such that...
AbstractWe construct a C(2m, 2m, 2) design which is a family of Hamilton cycles in K2m so that each ...
For k ⩾ 2 the complete multigraph λKn has a factorization into isomorphic spanning subgraphs, each c...
AbstractLet G be the set that contains precisely the graphs on n vertices with maximum degree 3 for ...
Let λ K denote the graph on a vertices with λ edges between every pair of vertices. Take p copies of...
We prove that for every $n$, there is a graph $G$ with $\chi(G) \geq n$ and $\omega(G) \leq 3$ such ...
AbstractA 4-graph is odd if its vertex set can be partitioned into two sets so that every edge inter...
AbstractLet J be a set of positive integers. Suppose m>1 and H is a complete m-partite graph with ve...
AbstractLet H be a graph having λ edges which has no loops and multiple edges. Complete results abou...
AbstractA resolvable (balanced) path design, RBPD(v, k, λ) is the decomposition of λ copies of the c...
AbstractAn even cycle decomposition of a graph is a partition of its edge into even cycles. We first...