Pages that link to "Item:Q3174234"

The following pages link to On bipartite 2-factorizations of kn − I and the Oberwolfach problem (Q3174234):

Displaying 39 items.

• Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575) (← links)
• A cyclic solution for an infinite class of Hamilton-Waterloo problems (Q292248) (← links)
• Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles (Q297926) (← links)
• On the existence of unparalleled even cycle systems (Q326644) (← links)
• Note on three table Oberwolfach problem (Q327632) (← links)
• A complete solution to the two-table Oberwolfach problems (Q385030) (← links)
• Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs (Q397162) (← links)
• Zero-sum flows for triple systems (Q729773) (← links)
• The solution of the bipartite analogue of the Oberwolfach problem (Q1184002) (← links)
• Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles (Q1678094) (← links)
• On the Hamilton-Waterloo problem with cycle lengths of distinct parities (Q1744749) (← links)
• Hamilton cycle rich 2-factorization of complete equipartite graphs. II (Q1928280) (← links)
• Resolution of the Oberwolfach problem (Q2039583) (← links)
• On the Oberwolfach problem for single-flip 2-factors via graceful labelings (Q2120828) (← links)
• The Hamilton-Waterloo problem with even cycle lengths (Q2319702) (← links)
• The structure of 2-pyramidal 2-factorizations (Q2345518) (← 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)
• Orthogonally Resolvable Cycle Decompositions (Q2950653) (← links)
• Hamilton cycle rich 2-factorization of complete bipartite graphs (Q3451064) (← links)
• (Q4634988) (← links)
• 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem (Q4906042) (← links)
• Bipartite 2‐Factorizations of Complete Multipartite Graphs (Q4982289) (← links)
• Merging Combinatorial Design and Optimization: the Oberwolfach Problem (Q4990113) (← 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)
• Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment (Q6146193) (← links)
• A complete solution to the infinite Oberwolfach problem (Q6187427) (← links)
• A constructive solution to the Oberwolfach problem with a large cycle (Q6204356) (← links)
• Solutions to the Oberwolfach problem for orders up to 100 (Q6562432) (← links)
• The Oberwolfach problem with loving couples (Q6584899) (← links)
• A survey on constructive methods for the Oberwolfach problem and its variants (Q6613359) (← links)
• On 2-factorizations of the complete 3-uniform hypergraph of order 12 minus a 1-factor (Q6616838) (← links)
• On the minisymposium problem (Q6617235) (← links)
• Resolution of the Oberwolfach problem (Q6621209) (← links)