Cube factorizations of complete graphs

DOI10.1002/JCD.20015MaRDI QIDQ3156930zbMATH OpenOpenAlexWikidataFDO

Authors Darryn Bryant, Barbara Maenhaut, P. Adams

Publication date 12 January 2005

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.20015

zbMATH Keywords

cube decompositionFactorizationuniform 3-factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Cube factorizations of complete multipartite graph.
• Cubic factorizations
• Factorizations of complete multipartite graphs into generalized cubes
• Decomposing complete graphs into cubes
• scientific article; zbMATH DE number 786149

Cited in

(14)

• Spanning cubic graph designs
• Cycle factorizations of cycle products
• Semi-perfect 1-factorizations of the hypercube
• Partial cubes and crossing graphs
• Cube factorizations of complete multipartite graph.
• Q₄-factorization of K_n and K_x(m)
• On perfectly one–factorable cubic graphs
• Solution to the problem of Kubesa
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• scientific article; zbMATH DE number 4055662 (Why is no real title available?)
• Cubic factorizations
• Factorizations of complete multipartite graphs into generalized cubes
• Q₅‐factorization of λK_n
• Factorization of \(K_{n,n}\) into \((0,j)\)-prisms

This page was built for publication: Cube factorizations of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156930)