Decompositions of complete graphs into isomorphic cubes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3503285 (Why is no real title available?)
- scientific article; zbMATH DE number 3517174 (Why is no real title available?)
- scientific article; zbMATH DE number 3634282 (Why is no real title available?)
- scientific article; zbMATH DE number 3435497 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- On the decomposition of a complete graph into 4k-gons
Cited in
(17)- Symmetric edge-decompositions of hypercubes
- Decompositions of complete graphs into isomorphic bipartite subgraphs
- New families of graphs that have \(\alpha\)-labelings
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
- Decomposition of K_v into some graph with six vertices and seven edges
- Graph designs for all graphs with six vertices and eight edges
- On Graceful Labelings of Trees
- A survey on the existence ofG-Designs
- Archimedean graph designs
- Decomposing the complete graph into dodecahedra
- Archimedean graph designs. II.
- Q5‐factorization of λKn
- On partitional labelings of graphs
- \(d\)-cube decompositions of \(K_n\setminus K_m\)
- All arbitrarily fixed generalized banana trees are graceful
- Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges
- Design spectra for 6-regular graphs with 12 vertices
This page was built for publication: Decompositions of complete graphs into isomorphic cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1170266)
