The solution of the bipartite analogue of the Oberwolfach problem
From MaRDI portal
Publication:1184002
DOI10.1016/0012-365X(91)90449-CzbMath0765.05080MaRDI QIDQ1184002
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
decompositioncyclescomplete graphOberwolfach problem2- regular graph2-regular factorspathlike factorizations
Related Items (29)
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors ⋮ Unnamed Item ⋮ \(C_{p}\)-decompositions of some regular graphs ⋮ A cyclic solution for an infinite class of Hamilton-Waterloo problems ⋮ Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ On the existence of k $k$‐cycle semiframes for even k $k$ ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs. ⋮ Uniformly resolvable cycle decompositions with four different factors ⋮ On the existence of cycle frames and almost resolvable cycle systems ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ The generalized almost resolvable cycle system problem ⋮ Rectangular table negotiation problem revisited ⋮ On the existence of holey 4-cycle frames ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ Almost resolvable cycle systems-an analogue of Hanani triple systems ⋮ Resolvable even cycle decompositions of the tensor product of complete graphs ⋮ Factorization of \(K_{n,n}\) into \((0,j)\)-prisms ⋮ Oberwolfach rectangular table negotiation problem ⋮ Resolution of the Oberwolfach problem ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ Bipartite 2‐Factorizations of Complete Multipartite Graphs ⋮ Pancomponented 2-factorizations of complete graphs ⋮ Unnamed Item ⋮ The equipartite Oberwolfach problem with uniform tables
Cites Work
This page was built for publication: The solution of the bipartite analogue of the Oberwolfach problem
