| Summary: | <p class="p1">Given two graphs <em>G</em> and <em>H</em>, a (<em>G</em>,<em>H</em>)-multidecomposition of <em>K<sub>n</sub></em> is a partition of the edges of <em>K<sub>n</sub></em> into copies of <em>G</em> and <em>H</em> such that at least one copy of each is used. We give necessary and sufficient conditions for the existence of (C<sub>6</sub>,Ċ<sub>6</sub>)-multidecomposition of <em>K<sub>n</sub></em> where C<sub>6</sub> denotes a cycle of length 6 and C<sub>6</sub> denotes the complement of C<sub>6</sub>. We also characterize the cardinalities of leaves and paddings of maximum (C<sub>6</sub>,Ċ<sub>6</sub>)-multipackings and minimum (C<sub>6</sub>,Ċ<sub>6</sub>)-multicoverings, respectively.</p>
|
|---|