G-designs and related designs
From MaRDI portal
Publication:1802138
DOI10.1016/0012-365X(93)90408-LzbMATH Open0783.05034MaRDI QIDQ1802138FDOQ1802138
Authors: Kazuhiko Ushio 
Publication date: 10 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Graph theory (05C99)
Cites Work
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Graph decompositions, handcuffed prisoners and balanced p-designs
- Title not available (Why is that?)
- Decomposition of complete multigraphs into stars
- On claw-decomposition of complete graphs and complete bigraphs
- Balanced incomplete block designs and related designs
- On the existence of balanced bipartite designs. II
- Factors and factorizations of graphs—a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Hamiltonian decompositions of complete graphs
- Title not available (Why is that?)
- Decomposition of complete graphs into stars
- Handcuffed 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
- On claw-decomposition of a complete multi-partite graph
- On the decomposition ofkn into complete bipartite graphs
- Existence of resolvable path designs
- Cycles in digraphs– a survey
- Another class of balanced graph designs: Balanced circuit designs
- Title not available (Why is that?)
- Bipartite decomposition of complete multipartite graphs
- \(C_ k\)-factorization of complete bipartite graphs
- Title not available (Why is that?)
- On the construction of handcuffed designs
- On the cyclic decompositions of the complete graph into polygons with odd number of edges
- Design of a new balanced file organization scheme with the least redundancy
- Title not available (Why is that?)
- Claw-decomposition and evenly-partite-claw-decomposition of complete multi-partite graphs
- On balanced claw designs of complete multi-partite graphs
- Edge partitions of complete multipartite graphs into equal length circuits
- Title not available (Why is that?)
- Resolvable balanced bipartite designs
- Partite-claw-decomposition of a complete multi-partite graph
- Title not available (Why is that?)
Cited In (40)
- On resolvable multipartite \(G\)-designs. II
- Balanced and strongly balanced \(P_k\)-designs
- \(K_{1,k}\)-factorization of bipartite graphs
- \(K_{1,p^2}\)-factorization of complete bipartite graphs
- \(G\)-design of \(\lambda\)-fold complete multipartite graph where \(G\) is three kinds of graphs with five points
- On \(K_{p,q}\)-factorization of complete bipartite multigraphs
- \(K_{p,q}\)-factorization of the complete bipartite graph \(K_{m,n}\)
- Resolvable path designs
- Local balance in graph decompositions
- Title not available (Why is that?)
- On resolvable multipartite \(G\)-designs
- \(K_{1,p^k}\)-factorization of complete bipartite graphs
- Path-factorizations of complete bipartite multigraphs
- Resolvable G-designs of order v and index {\lambda}
- Title not available (Why is that?)
- \(P_{4k-1}\)-factorization of bipartite multigraphs
- \(P_3\)-factorization of complete multipartite graphs
- Rotatable designs and \(\mathcal G\)-weakly invariant designs
- Superpure digraph designs
- The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs
- \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs
- \(P_{5}\)-factorization of complete bipartite graphs
- Path factorizations of complete multipartite graphs
- Title not available (Why is that?)
- Cycle-factorization of symmetric complete multipartite digraphs
- Petersen graph decompositions of complete multipartite graphs
- The proportion of various graphs in graph-designs
- Star-factorization of the complete bipartite multigraphs
- Title not available (Why is that?)
- Combinatorial configurations in the definition of antimagic labelings of graphs
- Star-factorization of symmetric complete bipartite digraphs
- The spectrum of path factorization of bipartite multigraphs
- Transitive path decompositions of Cartesian products of complete graphs
- \(\alpha\)-resolvable \(\lambda\)-fold \(G\)-designs
- Evenly partite star factorization of symmetric digraph of wreath product of graphs
- Decomposition of the complete bipartite multigraph into cycles and stars
- \(G\)-designs for the connected triangular bicyclic graphs with nine edges
- A survey on the existence ofG-Designs
- Path decompositions which contain no proper subsystems.
- On \(K_{1,k}\)-factorization of bipartite multigraphs
This page was built for publication: \(G\)-designs and related designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802138)
