Pages that link to "Item:Q3483304"

The following pages link to On the construction of odd cycle systems (Q3483304):

Displaying 46 items.

• 4-cycle systems of \(K_n-E(F^\ast)\) (Q497370) (← links)
• Decomposing certain equipartite graphs into sunlet graphs of length \(2p\) (Q504158) (← links)
• \(d\)-cube decompositions of \(K_n\setminus K_m\) (Q675883) (← links)
• Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
• Neighbor designs and m-wheel systems (Q753362) (← links)
• Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) (Q878054) (← links)
• The spectrum for lambda-fold 2-perfect 6-cycle systems (Q1185864) (← links)
• Nesting directed cycle systems of even length (Q1193557) (← links)
• 2-perfect \(m\)-cycle systems (Q1197006) (← links)
• Cycle decompositions of the line graph of \(K_ n\) (Q1208048) (← links)
• Decomposition of \(K_n\) into circuits of odd length (Q1239166) (← links)
• Packing pentagons into complete graphs: How clumsy can you get? (Q1322192) (← links)
• Maximum packings with odd cycles (Q1332431) (← links)
• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles (Q1399917) (← links)
• \(2p\)-cycle decompositions of some regular graphs and digraphs (Q1637135) (← 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)
• 3-simple 2-fold 5-cycle systems (Q1683582) (← links)
• A solution to the forest leave problem for partial 6-cycle systems (Q1827694) (← links)
• Cycle decompositions of \(K_n\) and \(K_n-I\) (Q1850511) (← links)
• Decomposing various graphs into short even-length cycles (Q1928579) (← links)
• Sunlet decomposition of certain equipartite graphs (Q1953667) (← links)
• On cycle systems with specified weak chromatic number (Q1957974) (← links)
• Pack graphs with subgraphs of size three (Q1990360) (← links)
• Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 (Q2214321) (← links)
• Resolvable even cycle decompositions of the tensor product of complete graphs (Q2275406) (← links)
• Decomposition of the Kneser graph into paths of length four (Q2342612) (← links)
• \(C_{4p}\)-frame of complete multipartite multigraphs (Q2375912) (← links)
• Maximum cyclic 4-cycle packings of the complete multipartite graph (Q2471047) (← links)
• On diagonal cycle systems (Q2760444) (← links)
• Cycle decompositions. III: Complete graphs and fixed length cycles. (Q2782295) (← links)
• Doyen-Wilson results for odd length cycle systems (Q2816379) (← links)
• On Decomposing the Complete Graph into the Union of Two Disjoint Cycles (Q2946050) (← links)
• A survey on the existence of<i>G</i>-Designs (Q3528164) (← links)
• Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes (Q3576977) (← links)
• A complete solution to the existence problem for 1-rotational<i>k</i>-cycle systems of<i>K</i><i>v</i> (Q3578152) (← links)
• (Q4024343) (← links)
• Dihedral Hamiltonian Cycle Systems of the Cocktail Party Graph (Q4909339) (← links)
• Even‐cycle systems with prescribed automorphism groups (Q4921428) (← links)
• $C_4$-decomposition of the tensor product of complete graphs (Q4957964) (← links)
• (Q4990119) (← links)
• (Q5139702) (← links)
• (Q5377023) (← links)
• (Q5463482) (← links)
• Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs (Q5744160) (← links)
• Primitive cycle decompositions of Kn and Kn−I (Q6146186) (← links)
• A reduction of the spectrum problem for odd sun systems and the prime case (Q6188108) (← links)