The following pages link to Packing cycles in complete graphs (Q947728):
Displaying 13 items.
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges (Q293622) (← links)
- Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
- Small cycles and 2-factor passing through any given vertices in graphs (Q711538) (← links)
- Almost resolvable maximum packings of complete graphs with 5-cycles (Q893340) (← links)
- Packing paths in complete graphs (Q965248) (← links)
- An asymptotic solution to the cycle decomposition problem for complete graphs (Q1957980) (← links)
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs (Q2311707) (← links)
- Decomposition of a complete bipartite multigraph into arbitrary cycle sizes (Q2409511) (← links)
- Small embeddings for partial 5-cycle systems (Q2885148) (← links)
- Maximum packings of the complete graph with uniform length cycles (Q3174232) (← links)
- Face 2-Colorable Embeddings with Faces of Specified Lengths (Q3188664) (← links)
- Cycle packings of the complete multigraph (Q4622608) (← links)
- Cycle decompositions of complete multigraphs (Q5894089) (← links)
