Decompositions of complete graphs into isomorphic cubes
From MaRDI portal
Publication:1170266
DOI10.1016/0095-8956(81)90031-9zbMath0496.05041WikidataQ30049100 ScholiaQ30049100MaRDI QIDQ1170266
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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Archimedean graph designs, Decomposing the complete graph into dodecahedra, Archimedean graph designs. II., 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, 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 \(\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, A survey on the existence ofG-Designs
Cites Work