Pages that link to "Item:Q1184002"

The following pages link to The solution of the bipartite analogue of the Oberwolfach problem (Q1184002):

Displaying 29 items.

• A cyclic solution for an infinite class of Hamilton-Waterloo problems (Q292248) (← links)
• On the existence of holey 4-cycle frames (Q488292) (← links)
• On the existence of cycle frames and almost resolvable cycle systems (Q641197) (← links)
• The generalized almost resolvable cycle system problem (Q653836) (← links)
• Rectangular table negotiation problem revisited (Q657422) (← links)
• Almost resolvable maximum packings of complete graphs with 5-cycles (Q893340) (← links)
• Factorization of \(K_{n,n}\) into \((0,j)\)-prisms (Q989530) (← links)
• Oberwolfach rectangular table negotiation problem (Q998546) (← links)
• The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs. (Q1401313) (← links)
• Uniformly resolvable cycle decompositions with four different factors (Q1696545) (← links)
• Completing the spectrum of almost resolvable cycle systems with odd cycle length (Q1709552) (← links)
• Cyclic uniform 2-factorizations of the complete multipartite graph (Q1756038) (← links)
• The equipartite Oberwolfach problem with uniform tables (Q1865407) (← links)
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors (Q1876686) (← links)
• Resolution of the Oberwolfach problem (Q2039583) (← links)
• Resolvable even cycle decompositions of the tensor product of complete graphs (Q2275406) (← links)
• \(C_{p}\)-decompositions of some regular graphs (Q2368932) (← links)
• A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors (Q2411595) (← links)
• Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices (Q2515559) (← links)
• Pancomponented 2-factorizations of complete graphs (Q2568477) (← links)
• Almost resolvable cycle systems-an analogue of Hanani triple systems (Q3578149) (← links)
• (Q4634988) (← links)
• Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem (Q4642156) (← links)
• On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors (Q4909344) (← links)
• (Q4934840) (← links)
• Bipartite 2‐Factorizations of Complete Multipartite Graphs (Q4982289) (← links)
• Merging Combinatorial Design and Optimization: the Oberwolfach Problem (Q4990113) (← links)
• On the existence of k $k$‐cycle semiframes for even k $k$ (Q6086214) (← links)
• On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles (Q6086218) (← links)