Spanning cubic graph designs

DOI10.1016/j.disc.2008.07.031zbMath1186.05022OpenAlexW2090338574MaRDI QIDQ1045074

Moshe Rosenfeld, Hayri Ardal, Ján Maňuch, Ladislav Stacho, Peter J. Adams, Vũ Đình Hòa

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.031

zbMATH Keywords

cubic graphblock designscomplete graphgraph decompositionconstruction toolsspanning cubic graph designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Cubic factorizations ⋮ A survey on the existence ofG-Designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• On a variation of the Oberwolfach problem
• A quick proof that \(K_{10}\neq{}P+P+P\)
• Hamiltonian decompositions of prisms over cubic graphs
• On resolvable designs. (Reprint)
• Zehnpunktige kubische Graphen
• Graph decompositions, handcuffed prisoners and balanced p-designs
• A note on 3-factorizations of K10
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• Cube factorizations of complete graphs
• One-factorizations of the complete graph—A survey
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• On the Oberwolfach problem with two similar length cycles

This page was built for publication: Spanning cubic graph designs