Pages that link to "Item:Q1865407"

The following pages link to The equipartite Oberwolfach problem with uniform tables (Q1865407):

Displaying 40 items.

• A cyclic solution for an infinite class of Hamilton-Waterloo problems (Q292248) (← links)
• Ascending subgraph decompositions in oriented complete balanced tripartite graphs (Q367066) (← links)
• On the directed Oberwolfach problem with equal cycle lengths (Q405089) (← links)
• Decomposing complete equipartite graphs into odd square-length cycles: number of parts even (Q418858) (← links)
• On the existence of holey 4-cycle frames (Q488292) (← links)
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors (Q501060) (← links)
• On the existence of cycle frames and almost resolvable cycle systems (Q641197) (← links)
• More results on cycle frames and almost resolvable cycle systems (Q713167) (← links)
• Almost resolvable maximum packings of complete graphs with 5-cycles (Q893340) (← links)
• Path and cycle decompositions of complete equipartite graphs: Four parts (Q1025923) (← 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)
• On the Hamilton-Waterloo problem with cycle lengths of distinct parities (Q1744749) (← links)
• Cyclic uniform 2-factorizations of the complete multipartite graph (Q1756038) (← links)
• On a generalization of the Oberwolfach problem (Q1826944) (← links)
• Six-cycle systems (Q2054649) (← links)
• Ascending subgraph decompositions of oriented graphs that factor into triangles (Q2151215) (← links)
• Resolvable even cycle decompositions of the tensor product of complete graphs (Q2275406) (← links)
• The Hamilton-Waterloo problem with even cycle lengths (Q2319702) (← 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)
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles (Q2637730) (← links)
• A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
• Orthogonally Resolvable Cycle Decompositions (Q2950653) (← links)
• Decomposing complete equipartite graphs into short even cycles (Q3084613) (← links)
• Factorizations of complete graphs into cycles and 1-factors (Q3303519) (← links)
• Closed trail decompositions of complete equipartite graphs (Q3578148) (← links)
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths (Q3617969) (← 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)
• Bipartite 2‐Factorizations of Complete Multipartite Graphs (Q4982289) (← links)
• Decompositions of complete symmetric directed graphs into the oriented heptagons (Q5101833) (← links)
• (Q5109050) (← links)
• On the generalized Oberwolfach problem (Q5217059) (← links)
• On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity (Q5217091) (← links)
• The Hamilton-Waterloo problem for triangle-factors and heptagon-factors (Q5964990) (← links)
• Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem (Q6071955) (← links)
• On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles (Q6086218) (← links)