On a variation of the Oberwolfach problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3485815 (Why is no real title available?)
- scientific article; zbMATH DE number 3563140 (Why is no real title available?)
- scientific article; zbMATH DE number 3590280 (Why is no real title available?)
- scientific article; zbMATH DE number 3596859 (Why is no real title available?)
- scientific article; zbMATH DE number 3435497 (Why is no real title available?)
- scientific article; zbMATH DE number 3443685 (Why is no real title available?)
- scientific article; zbMATH DE number 3237887 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- scientific article; zbMATH DE number 3349817 (Why is no real title available?)
- On Partially Resolvable t–Partitions
- On the existence of automorphism free Steiner triple systems
- Parallel concepts in graph theory
- Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)
Cited in
(36)- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Spanning cubic graph designs
- A brief review on Egmont Köhler's mathematical work
- On the Oberwolfach problem for complete multigraphs
- The Oberwolfach problem and factors of uniform odd length cycles
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- On a generalization of the Oberwolfach problem
- The equipartite Oberwolfach problem with uniform tables
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- Resolution of the Oberwolfach problem
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings
- Ascending subgraph decompositions of oriented graphs that factor into triangles
- The structure of 2-pyramidal 2-factorizations
- The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
- Note on three table Oberwolfach problem
- A complete solution to the two-table Oberwolfach problems
- On the directed Oberwolfach problem with equal cycle lengths
- 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
- On the Hamilton-Waterloo problem for bipartite 2-factors
- scientific article; zbMATH DE number 1394637 (Why is no real title available?)
- Merging combinatorial design and optimization: the Oberwolfach problem
- The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
- Regular Oberwolfach problems and group sequencings
- On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
- Completing the solution of the directed Oberwolfach problem with cycles of equal length
- A constructive solution to the Oberwolfach problem with a large cycle
- The Oberwolfach problem with loving couples
- A survey on constructive methods for the Oberwolfach problem and its variants
- Resolution of the Oberwolfach problem
- Completing the solution of the directed Oberwolfach problem with two tables
- The directed Oberwolfach problem with variable cycle lengths: a recursive construction
- Transforming solutions for the Oberwolfach problem into solutions for the spouse-loving variant
- Near 2-factorizations of \(2K_ n:\) Cycles of even length
- On resolvable mixed path designs
This page was built for publication: On a variation of the Oberwolfach problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140095)
