The following pages link to Packing paths in complete graphs (Q965248):
Displaying 19 items.
- Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575) (← links)
- 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)
- Odd path packings (Q757435) (← links)
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs (Q965242) (← links)
- Hamilton path decompositions of complete multipartite graphs (Q1719570) (← links)
- Minimal path decomposition of complete bipartite graphs (Q1743479) (← links)
- The path set packing problem (Q1790987) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- Decompositions of line graphs of complete graphs into paths and cycles (Q2092392) (← links)
- Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars (Q2175240) (← links)
- Decompositions of complete multigraphs into stars of varying sizes (Q2200917) (← links)
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs (Q2311707) (← links)
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations (Q2319700) (← links)
- Vertex-transitive graphs that have no Hamilton decomposition (Q2349515) (← links)
- Decomposition of a complete bipartite multigraph into arbitrary cycle sizes (Q2409511) (← links)
- Small embeddings for partial 5-cycle systems (Q2885148) (← links)
- Packings and 2-packings of A-paths (Q3439371) (← links)
- Packing Digraphs with Directed Closed Trails (Q4796722) (← links)
