On the spectrum for Km+2 \ Km designs
From MaRDI portal
Publication:4222143
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1997)5:1<49::AID-JCD4>3.0.CO;2-Y" /><49::AID-JCD4>3.0.CO;2-Y 10.1002/(SICI)1520-6610(1997)5:1<49::AID-JCD4>3.0.CO;2-YzbMath0915.05012OpenAlexW1968337595MaRDI QIDQ4222143
Elizabeth J. Billington, D. G. Hoffman, Peter J. Adams
Publication date: 5 July 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1997)5:1<49::aid-jcd4>3.0.co;2-y
Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)
Related Items (5)
A survey on the existence ofG-Designs ⋮ Designs for graphs with six vertices and ten edges -- II ⋮ A complete solution to the spectrum problem for graphs with six vertices and up to nine edges ⋮ Unnamed Item ⋮ Designs for graphs with six vertices and ten edges
This page was built for publication: On the spectrum for Km+2 \ Km designs
