Decomposing \(K_{n} \cup P\) into triangles

DOI10.1016/j.disc.2003.04.003zbMath1044.05023OpenAlexW2199099322MaRDI QIDQ1876681

C. A. Rodger, Chin-Mei Fu, Hung-Lin Fu

Publication date: 20 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.04.003

zbMATH Keywords

packing problemCoveringForestTriple system

Mathematics Subject Classification ID

Triple systems (05B07) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

\(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\) ⋮ Directed 3-cycle decompositions of complete directed graphs with quadratic leaves ⋮ Achromatic numbers of Kneser graphs

Cites Work

• Quadratic leaves of maximal partial triple systems
• Balanced incomplete block designs and related designs
• Group divisible designs with two associate classes: \(n=2\) or \(m=2\)
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing \(K_{n} \cup P\) into triangles