Path decompositions which contain no proper subsystems.

MaRDI QIDQ2864435zbMATH OpenFDO

Authors Chandra Dinavahi, C. A. Rodger

Publication date 6 December 2013

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

graph decompositiongraph designproper subsystem

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51)

Recommendations

• Maximum packings of \(K_v\) with copies of \(P_3\) which contain no proper subsystems
• Balanced and strongly balanced \(P_k\)-designs
• \(G\)-designs and related designs
• Embedding path designs in 4-cycle systems
• Embedding of a \(\mu\)-fold \(P_3\)-design into a \(\lambda\)-fold triple system

Cited in

(4)

• 2-primitive \(C_3\)-decompositions of cocktail party graphs
• Primitive cycle decompositions of Kn and Kn−I
• Maximum packings of \(K_v\) with copies of \(P_3\) which contain no proper subsystems
• Primitive C4 ${C}_{4}$‐decompositions of Kn−I ${K}_{n}-I$

This page was built for publication: Path decompositions which contain no proper subsystems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864435)