Note on three table Oberwolfach problem

DOI10.1016/J.ENDM.2016.05.009zbMATH Open1347.05161OpenAlexW2517286968MaRDI QIDQ327632FDOQ327632

Authors: A. Muthusamy, A. Shanmuga Vadivu 

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.009

Recommendations

• scientific article; zbMATH DE number 5994589
• scientific article; zbMATH DE number 6452866
• On the Oberwolfach problem OP\((5^a, s)\)
• Some cyclic solutions to the three table Oberwolfach problem
• SOME RESULTS ON THE OBERWOLFACH PROBLEM

zbMATH Keywords

2-factorizationcycle frameOberwolfach problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
• Near 2-factorizations of \(2K_ n:\) Cycles of even length
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• Title not available (Why is that?)
• A complete solution to the two-table Oberwolfach problems
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• Title not available (Why is that?)
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• On a variation of the Oberwolfach problem
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• On the Oberwolfach problem for complete multigraphs
• The Oberwolfach problem and factors of uniform odd length cycles
• Cube factorizations of complete multipartite graph.
• Cycle frames of complete multipartite multigraphs. III
• Some results on the Oberwolfach problem \(\text{OP}_2(3^a,s^b)\)
• Title not available (Why is that?)
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• Some results on the Oberwolfach problem \(\text{OP}_2 (3^a,s^b)\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
• Two-factorizations of the complete graph
• Title not available (Why is that?)
• On the Oberwolfach problem with two similar length cycles

Cited In (19)

• Some cyclic solutions to the three table Oberwolfach problem
• On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
• Cycle frames and the Oberwolfach problem
• SOME RESULTS ON THE OBERWOLFACH PROBLEM
• A complete solution to the two-table Oberwolfach problems
• Sectionable terraces and the (generalised) Oberwolfach problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Merging combinatorial design and optimization: the Oberwolfach problem
• On the generalized Oberwolfach problem
• On the Hamilton-Waterloo problem
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• On the Oberwolfach problem with two similar length cycles
• A constructive solution to the Oberwolfach problem with a large cycle
• The equipartite Oberwolfach problem with uniform tables
• Some results on the Oberwolfach problem \(\text{OP}_2 (3^a,s^b)\)
• Some results on the Oberwolfach problem \(\text{OP}_2(3^a,s^b)\)
• On the honeymoon Oberwolfach problem
• The number of triangles in 2‐factorizations

This page was built for publication: Note on three table Oberwolfach problem

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