Decomposition of complete multigraphs into stars
From MaRDI portal
Publication:1132885
Cites work
Cited in
(44)- On the decomposition of a graph into stars
- On balanced claw designs of complete multi-partite graphs
- Directed star decompositions of directed multigraphs
- Nesting directed cycle systems of even length
- Resolvable tree designs
- On colored designs. I
- The intersection problem for star designs
- Amalgamations of connected \(k\)-factorizations.
- \(G\)-designs and related designs
- On colored designs. II
- Decomposition of complete graphs into cycles and stars
- Multidecompositions of the balanced complete bipartite graph into paths and stars
- Pack graphs with subgraphs of size three
- Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
- Decompositions of complete multigraphs into stars of varying sizes
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
- Balls, bins, and embeddings of partial \(k\)-star designs
- Decomposition of the complete bipartite multigraph into cycles and stars
- Decomposition of complete multigraphs into crown graphs
- The volume and foundation of star trades
- Balanced star decompositions of regular multigraphs and \(\lambda\)-fold complete bipartite graphs
- Smaller embeddings of partial \(k\)-star decompositions
- Star factorizations of graph products
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
- Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars
- A survey on the existence ofG-Designs
- Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
- On the existence of k-sun systems
- Decomposition of product graphs into sunlet graphs of order eight
- A subspace covering problem in the n-cube
- Decomposition of complete graphs into isomorphic complete bipartite graphs
- Decomposition of cartesian product of complete graphs into sunlet graphs of order eight
- Decomposition of the line graph of the complete graph into stars
- Decomposing complete graphs into isomorphic complete multipartite graphs
- Decomposition of complete graphs into paths and stars with different number of edges
- Embedding partial 3-star designs
- Decompositions of complete multigraphs into cycles of varying lengths
- Completing partial k-star designs
- Decomposing random regular graphs into stars
- Multi-decomposition of complete graphs into stars and bowties of size 6
- Construction of 3-helix systems of any index
- Decomposition of complete multigraphs into stars and cycles
- Decomposition of balanced complete bipartite multigraphs into multistars
- Decomposition of complete graphs into paths and stars
This page was built for publication: Decomposition of complete multigraphs into stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132885)