Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges
From MaRDI portal
Publication:692744
DOI10.1007/s10255-012-0191-1zbMath1292.05184MaRDI QIDQ692744
Publication date: 6 December 2012
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-012-0191-1
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C51: Graph designs and isomorphic decomposition
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.
- Decomposition of \(\lambda K_v\) into some graph with six vertices and seven edges
- Graph designs for all graphs with six vertices and eight edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item