Existence of resolvable path designs

DOI10.1016/S0195-6698(13)80120-5zbMath0712.05045OpenAlexW2045675394MaRDI QIDQ923105

Katherine Heinrich, Min-Li Yu, Jean-Claude Bermond

Publication date: 1990

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80120-5

zbMATH Keywords

partitionfactorizationresolvablespanning subgraphcomplete multigraph\(P_ k\)-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (16)

On the chromatic index of path decompositions ⋮ Almost resolvable P_k‐decompositions of complete graphs ⋮ On tree factorizations of K_n ⋮ Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs ⋮ Block colourings of star systems ⋮ Scheduling to reduce close contacts: resolvable grid graph decomposition and packing ⋮ Unnamed Item ⋮ A survey on the existence ofG-Designs ⋮ On resolvable mixed path designs ⋮ Nesting directed cycle systems of even length ⋮ Resolvable tree designs ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ \(G\)-designs and related designs ⋮ Path factorizations of complete multipartite graphs ⋮ Complex uniformly resolvable decompositions of K_v ⋮ On path factorizations of complete multipartite graphs

Cites Work

• Resolvable path designs
• The Oberwolfach problem and factors of uniform odd length cycles
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Handcuffed designs
• Unnamed Item

This page was built for publication: Existence of resolvable path designs