The Existence and Construction of (K5∖e)-Designs of Orders 27, 135, 162, and 216
From MaRDI portal
Publication:2842261
DOI10.1002/jcd.21340zbMath1269.05019MaRDI QIDQ2842261
Publication date: 13 August 2013
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21340
05B05: Combinatorial aspects of block designs
05B30: Other designs, configurations
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C51: Graph designs and isomorphic decomposition
Related Items
Designs for graphs with six vertices and ten edges, 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, A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks, Optimal Groomings with Grooming Ratios Six and Seven
Cites Work