Decompositions of complete graphs into isomorphic cubes

DOI10.1016/0095-8956(81)90031-9MaRDI QIDQ1170266zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Anton Kotzig

Publication date 1981

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(81)90031-9

zbMATH Keywords

cyclic decompositiond-dimensional cubevaluation of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(16)

• Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
• Decomposition of \(\lambda K_v\) into five graphs with six vertices and eight edges
• Symmetric edge-decompositions of hypercubes
• Q₅‐factorization of λK_n
• Decomposition of K_v into some graph with six vertices and seven edges
• Graph designs for all graphs with six vertices and eight edges
• All arbitrarily fixed generalized banana trees are graceful
• On partitional labelings of graphs
• On Graceful Labelings of Trees
• New families of graphs that have \(\alpha\)-labelings
• A survey on the existence ofG-Designs
• Decompositions of complete graphs into isomorphic bipartite subgraphs
• Archimedean graph designs
• Decomposing the complete graph into dodecahedra
• \(d\)-cube decompositions of \(K_n\setminus K_m\)
• Archimedean graph designs. II.

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)