Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges.
From MaRDI portal
Publication:5310225
Recommendations
- Decomposition of K_v into some graph with six vertices and seven edges
- Graph designs for nine graphs with six vertices and nine edges
- scientific article; zbMATH DE number 1961003
- Decompositions of K_v into the graphs with 7 points, 7 edges and a 5-circle.
- Decomposing K_v into the graphs with seven vertices, seven edges and one 5-cycle for any index
Cited in
(14)- Decompositions of \(\lambda K_v\)
- Decomposition of K_v into some graph with six vertices and seven edges
- Decomposing K_v into the graphs with seven vertices, seven edges and one 5-cycle for any index
- Graph designs for nine graphs with six vertices and nine edges
- \(G\)-decomposition of \(\lambda K_{v}\), where \(G\) has six vertices and nine edges.
- A survey on the existence ofG-Designs
- scientific article; zbMATH DE number 2016714 (Why is no real title available?)
- Decompositions of K_v into the graphs with 7 points, 7 edges and a 5-circle.
- Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges
- G-designs for the connected triangular bicyclic graphs with nine edges
- Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices
- Decomposition of complete graphs on \(n\equiv 0,1\pmod{14}\) vertices into disconnected unicyclic tripartite graphs on seven edges
- Decomposition of -fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges
- Decomposition of complete graphs into disconnected bipartite graphs with seven edges and eight vertices
This page was built for publication: Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310225)
