Smaller embeddings of partial \(k\)-star decompositions
From MaRDI portal
Publication:2684891
DOI10.37236/10759OpenAlexW3203526705MaRDI QIDQ2684891
Daniel Horsley, Ajani De Vas Gunasekara
Publication date: 17 February 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.13475
Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of complete multigraphs into stars
- On the decomposition of a graph into stars
- On claw-decomposition of complete graphs and complete bigraphs
- The real truth about star designs
- Decompositions of complete multigraphs into stars of varying sizes
- Balls, bins, and embeddings of partial \(k\)-star designs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Embedding Partial k‐Star Designs
This page was built for publication: Smaller embeddings of partial \(k\)-star decompositions