Decompositions of complete graphs into isomorphic cubes

DOI10.1016/0095-8956(81)90031-9zbMath0496.05041DBLPjournals/jct/Kotzig81OpenAlexW1989096052WikidataQ30049100 ScholiaQ30049100MaRDI QIDQ1170266

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

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

Related Items (16)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decompositions of complete graphs into isomorphic cubes