Graph designs for all graphs with six vertices and eight edges

DOI10.1007/s10255-005-0254-7zbMath1105.05011OpenAlexW2357032773MaRDI QIDQ2508041

Shuxia Liu, Qing-de Kang, Lan-dang Yuan

Publication date: 9 October 2006

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-005-0254-7

zbMATH Keywords

quasigroupgraph designholey graph 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)

Related Items (6)

A survey on the existence ofG-Designs ⋮ Packings and coverings of various complete graphs with the 4-cycle with a pendant edge ⋮ Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges ⋮ A complete solution to the spectrum problem for graphs with six vertices and up to nine edges ⋮ Unnamed Item ⋮ Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges

Cites Work

• Decompositions of complete graphs into isomorphic cubes
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord.
• Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph designs for all graphs with six vertices and eight edges