Spanning cubic graph designs
From MaRDI portal
Publication:1045074
DOI10.1016/j.disc.2008.07.031zbMath1186.05022MaRDI QIDQ1045074
Moshe Rosenfeld, Ján Maňuch, Vũ Đình Hòa, Ladislav Stacho, Hayri Ardal, Peter J. Adams
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
cubic graph; block designs; complete graph; graph decomposition; construction tools; spanning cubic graph designs
05B05: Combinatorial aspects of block designs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
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