Pages that link to "Item:Q1957980"

The following pages link to An asymptotic solution to the cycle decomposition problem for complete graphs (Q1957980):

Displaying 16 items.

• Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions (Q707023) (← links)
• Decompositions of complete graphs into blown-up cycles \(C_m\)[2] (Q966036) (← links)
• Cyclically decomposing the complete graph into cycles (Q1827757) (← links)
• Decomposing the complete graph into cycles of many lengths (Q1895814) (← links)
• Decomposing various graphs into short even-length cycles (Q1928579) (← links)
• Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths (Q2397526) (← links)
• Decomposition of a complete bipartite multigraph into arbitrary cycle sizes (Q2409511) (← links)
• Small embeddings for partial 5-cycle systems (Q2885148) (← links)
• Neighborhoods in Maximum Packings of 2<i>K_n</i>and Quadratic Leaves of Triple Systems (Q2935204) (← links)
• Decomposing complete equipartite graphs into short even cycles (Q3084613) (← links)
• Maximum packings of the complete graph with uniform length cycles (Q3174232) (← links)
• Face 2-Colorable Embeddings with Faces of Specified Lengths (Q3188664) (← links)
• (Q5314385) (← links)
• Cycle decompositions of complete multigraphs (Q5894089) (← links)
• A generalization of the problem of Mariusz Meszka (Q5964995) (← links)