Decompositions of complete multigraphs into stars of varying sizes
Authors:
- Rosalind A. CameronRCRosalind A. Cameron
- Daniel HorsleyDHDaniel Horsley
- 1 November 2020
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 145, 32-64
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Australian Research Council
This publication has 13 references indexed in Scilit:
- Decompositions of complete multigraphs into cycles of varying lengthsJournal of Combinatorial Theory, Series B, 2018
- Tournaments associated with multigraphs and a theorem of HakimiDiscrete Mathematics, 2015
- Packing paths in complete graphsJournal of Combinatorial Theory, Series B, 2010
- Multigraph decomposition into stars and into multistarsDiscrete Mathematics, 2005
- The real truth about star designsDiscrete Mathematics, 2004
- The Difference Between Consecutive Primes, IIProceedings of the London Mathematical Society, 2001
- Star Decompositions of CubesGraphs and Combinatorics, 2001
- A necessary and sufficient condition for the star decomposition of complete graphsJournal of Graph Theory, 1996
- Partitions, packings and coverings by families with nonempty intersectionsJournal of Combinatorial Theory, Series A, 1992
- On dominance relations and the structure of animal societies: III The condition for a score structureBulletin of Mathematical Biology, 1953