Note on three table Oberwolfach problem
From MaRDI portal
Publication:327632
DOI10.1016/J.ENDM.2016.05.009zbMath1347.05161OpenAlexW2517286968MaRDI QIDQ327632
A. Shanmuga Vadivu, Appu Muthusamy
Publication date: 19 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.009
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (1)
Cites Work
- A complete solution to the two-table Oberwolfach problems
- Near 2-factorizations of \(2K_ n:\) Cycles of even length
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- On a variation of the Oberwolfach problem
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- On the Oberwolfach problem for complete multigraphs
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
- On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
- The Oberwolfach problem and factors of uniform odd length cycles
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- Cycle Frames of Complete Multipartite Multigraphs - III
- SOME RESULTS ON THE OBERWOLFACH PROBLEM
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- On the Oberwolfach problem with two similar length cycles
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Note on three table Oberwolfach problem