Almost resolvable Pk‐decompositions of complete graphs

DOI10.1002/jgt.3190150506zbMath0758.05089OpenAlexW2294304033MaRDI QIDQ3984462

Min-Li Yu

Publication date: 27 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190150506

zbMATH Keywords

complete graphsalmost \(P_ k\)-factoralmost resolvable \(P_ k\)- decomposition

Mathematics Subject Classification ID

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

Related Items (1)

On the chromatic index of path decompositions

Cites Work

• Existence of resolvable path designs

This page was built for publication: Almost resolvable P_k‐decompositions of complete graphs