The Existence and Construction of (K5∖e)-Designs of Orders 27, 135, 162, and 216

DOI10.1002/jcd.21340zbMath1269.05019OpenAlexW2119520198MaRDI QIDQ2842261

Emre Kolotoğlu

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

zbMATH Keywords

graph decompositionisomorph rejection\((K_{5} \setminus e)\)-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Related Items

Optimal Groomings with Grooming Ratios Six and Seven, 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, A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

Cites Work

• Unnamed Item
• A survey on the existence ofG-Designs
• On the Existence of $(K_5 \setminuse)$-Designs with Application to Optical Networks
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture