Answers are grounded in this paper and cite their sources.
Let L(Kn) be the line graph of Kn and let HS6 be the graph obtained from a 4-cycle by attaching a pendant edge at each of two antipodal vertices. We prove that L(Kn) has an HS6-decomposition if and only if n≥4 and n≢3(mod4). The proof splits L(Kn) into smaller line graphs together with graphs W(m,k) built from k triangle bundles glued along shared degree-two vertices, characterises the single-copy case, and handles W(m,2) via a construction attached to each cycle of a cycle decomposition of Km.
No takes yet. Share an insight, caveat, or question.
Palaniyandi et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: