The directed uniform Hamilton-Waterloo problem involving even cycle sizes

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Cites work

scientific article; zbMATH DE number 3922695 (Why is no real title available?)
scientific article; zbMATH DE number 3392464 (Why is no real title available?)
A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
A constructive solution to the Oberwolfach problem with a large cycle
Completing the solution of the directed Oberwolfach problem with cycles of equal length
Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
Factorizations of complete graphs into cycles and 1-factors
Mathematical recreations
On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
On the Hamilton-Waterloo problem
On the Hamilton-Waterloo problem for bipartite 2-factors
On the Hamilton-Waterloo problem with cycle lengths of distinct parities
On the Hamilton-Waterloo problem with odd cycle lengths
On the Hamilton-Waterloo problem with odd orders
On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors
On the directed Hamilton-Waterloo problem with two cycle sizes
On the directed Oberwolfach Problem with equal cycle lengths: the odd case
On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles
On the directed Oberwolfach problem with equal cycle lengths
Resolution of the Oberwolfach problem
Resolvable Mendelsohn designs with block size 4
Resolvable Mendelsohn triple systems with equal sized holes
Resolvable decomposition of K^*_n
Resolvable perfect Mendelsohn designs with block size five
Some observations on the oberwolfach problem
The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
The Hamilton-Waterloo problem with even cycle lengths
The Oberwolfach problem and factors of uniform odd length cycles
The chromatic index of complete multipartite graphs
The equipartite Oberwolfach problem with uniform tables
The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
Ueber eine Steinersche combinatorische Aufgabe, welche im 45sten Bande dieses Journals, Seite 181, gestellt worden ist.

This page was built for publication: The directed uniform Hamilton-Waterloo problem involving even cycle sizes

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