AbstractNecessary and sufficient conditions are given for the edge-disjoint decomposition of a complete tripartite graph Kr,s,t into exactly α 3-cycles and β 4-cycles
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph ...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
Let $C_{k}$ and $P_{k}$ denote a cycle and a path on $k$ vertices, respectively. In this paper, we o...
The complete tripartite graph Kn,n,n has 3n(2) edges. For any collection of positive integers x(1), ...
summary:The complete tripartite graph $K_{n,n,n}$ has $3n^2$ edges. For any collection of positive i...
summary:The complete tripartite graph $K_{n,n,n}$ has $3n^2$ edges. For any collection of positive i...
Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r les...
AbstractIn 1998 Cavenagh [N.J. Cavenagh, Decompositions of complete tripartite graphs into k-cycles,...
AbstractLet K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, whe...
AbstractIn 1998 Cavenagh [N.J. Cavenagh, Decompositions of complete tripartite graphs into k-cycles,...
In 1998 Cavenagh [N.J. Cavenagh, Decompositions of complete tripartite graphs into k-cycles, Austral...
AbstractA 4-cycle in a tripartite graph with vertex partition {V1,V2,V3} is said to be gregarious if...
Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any compl...
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph ...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
Let $C_{k}$ and $P_{k}$ denote a cycle and a path on $k$ vertices, respectively. In this paper, we o...
The complete tripartite graph Kn,n,n has 3n(2) edges. For any collection of positive integers x(1), ...
summary:The complete tripartite graph $K_{n,n,n}$ has $3n^2$ edges. For any collection of positive i...
summary:The complete tripartite graph $K_{n,n,n}$ has $3n^2$ edges. For any collection of positive i...
Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r les...
AbstractIn 1998 Cavenagh [N.J. Cavenagh, Decompositions of complete tripartite graphs into k-cycles,...
AbstractLet K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, whe...
AbstractIn 1998 Cavenagh [N.J. Cavenagh, Decompositions of complete tripartite graphs into k-cycles,...
In 1998 Cavenagh [N.J. Cavenagh, Decompositions of complete tripartite graphs into k-cycles, Austral...
AbstractA 4-cycle in a tripartite graph with vertex partition {V1,V2,V3} is said to be gregarious if...
Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any compl...
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph ...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
DOI
Add to ORKG