\(G\)-designs and related designs
From MaRDI portal
Publication:1802138
DOI10.1016/0012-365X(93)90408-LzbMath0783.05034MaRDI QIDQ1802138
Publication date: 10 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Graph theory (05C99)
Related Items (25)
Star-factorization of symmetric complete bipartite digraphs ⋮ The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs ⋮ \(P_{4k-1}\)-factorization of bipartite multigraphs ⋮ \(K_{1,k}\)-factorization of bipartite graphs ⋮ Petersen graph decompositions of complete multipartite graphs ⋮ Evenly partite star factorization of symmetric digraph of wreath product of graphs ⋮ Star-factorization of the complete bipartite multigraphs ⋮ Path-factorizations of complete bipartite multigraphs ⋮ On \(K_{p,q}\)-factorization of complete bipartite multigraphs ⋮ A survey on the existence ofG-Designs ⋮ The spectrum of path factorization of bipartite multigraphs ⋮ \(P_{5}\)-factorization of complete bipartite graphs ⋮ \(K_{1,p^k}\)-factorization of complete bipartite graphs ⋮ On resolvable multipartite \(G\)-designs. II ⋮ Combinatorial configurations in the definition of antimagic labelings of graphs ⋮ Unnamed Item ⋮ On \(K_{1,k}\)-factorization of bipartite multigraphs ⋮ \(K_{p,q}\)-factorization of the complete bipartite graph \(K_{m,n}\) ⋮ \(P_3\)-factorization of complete multipartite graphs ⋮ \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs ⋮ Path factorizations of complete multipartite graphs ⋮ Cycle-factorization of symmetric complete multipartite digraphs ⋮ \(K_{1,p^2}\)-factorization of complete bipartite graphs ⋮ Decomposition of the complete bipartite multigraph into cycles and stars ⋮ Superpure digraph designs
Cites Work
- Hamiltonian decompositions of complete graphs
- Existence of resolvable path designs
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- Resolvable path designs
- \(P_ 3\)-factorization of complete bipartite graphs
- \(C_ k\)-factorization of complete bipartite graphs
- Claw-decomposition and evenly-partite-claw-decomposition of complete multi-partite graphs
- Decomposition of complete multigraphs into stars
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- On balanced claw designs of complete multi-partite graphs
- Bipartite decomposition of complete multipartite graphs
- On claw-decomposition of complete graphs and complete bigraphs
- Another class of balanced graph designs: Balanced circuit designs
- Edge partitions of complete multipartite graphs into equal length circuits
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Resolvable balanced bipartite designs
- Balanced incomplete block designs and related designs
- Partite-claw-decomposition of a complete multi-partite graph
- On claw-decomposition of a complete multi-partite graph
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- On the existence of balanced bipartite designs. II
- On the construction of handcuffed designs
- Graph decompositions, handcuffed prisoners and balanced p-designs
- Factors and factorizations of graphs—a survey
- Cycles in digraphs– a survey
- On the decomposition ofkn into complete bipartite graphs
- Design of a new balanced file organization scheme with the least redundancy
- On the cyclic decompositions of the complete graph into polygons with odd number of edges
- Decomposition of complete graphs into stars
- Handcuffed designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(G\)-designs and related designs
