scientific article; zbMATH DE number 1394637
From MaRDI portal
Publication:4934840
Recommendations
- On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
- On the Oberwolfach problem for complete multigraphs
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
- Publication:4508368
- \(C_ k\)-factorization of complete bipartite graphs
- scientific article; zbMATH DE number 1011078
- Some problems about \(r\)-factorizations of complete graphs
- A method to construct 1-rotational factorizations of complete graphs and solutions to the Oberwolfach problem
- Factorizations of complete multipartite graphs into generalized cubes
- scientific article; zbMATH DE number 5155854
Cites work
- Hamiltonian decomposition of lexicographic product
- On a variation of the Oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The solution of the bipartite analogue of the Oberwolfach problem
- Two new direct product‐type constructions for resolvable group‐divisible designs
Cited in
(31)- On the honeymoon Oberwolfach problem
- Sectionable terraces and the (generalised) Oberwolfach problem
- More results on cycle frames and almost resolvable cycle systems
- On a generalization of the Oberwolfach problem
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
- A survey on constructive methods for the Oberwolfach problem and its variants
- A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
- The Hamilton-Waterloo problem with even cycle lengths
- On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
- Path and cycle decompositions of complete equipartite graphs: Four parts
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- On the minisymposium problem
- Almost resolvable maximum packings of complete graphs with 5-cycles
- On the existence of k $k$‐cycle semiframes for even k $k$
- \(C_7\)-decompositions of the tensor product of complete graphs
- Decompositions of complete symmetric directed graphs into the oriented heptagons
- The equipartite Oberwolfach problem with uniform tables
- Rectangular table negotiation problem revisited
- Uniformly resolvable \({P_4, C_k}\)-decomposition of \(K_n\) -- a complete solution
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
- Resolvable gregarious cycle decompositions of complete equipartite graphs
- Decomposing complete equipartite graphs into short even cycles
- On the Hamilton-Waterloo problem with cycle lengths of distinct parities
- Factorizations of complete multipartite hypergraphs
- On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
- On the existence of holey 4-cycle frames
- On z-cycle factorizations with two associate classes where z is 2a and a is even
- On the existence of cycle frames and almost resolvable cycle systems
- Cyclic uniform 2-factorizations of the complete multipartite graph
- On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
- Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934840)
