关于完全图K_n的{P_4,C_4}-分解

Decomposition of complete graphs into {P4,C4}

讨论了完全图Kn分解成四个顶点的路和圈的存在性,给出完全图Kn存在{P4,C4}-强制分解的充要条件是n≥5且n≠6.以及完全图Kn存在{P4,C4}-分解的充要条件是n≥4.

The existence of the decomposition of complete graphs Kn into path and cycle that has four vertexes is discussed. The necessary and sufficient condition for the existence of mandatory decomposition of complete graphs Kn into {P4, C4|is n >5 and n= 6. The necessary and sufficient condition for the existence of decomposition of complete graphs Kn into {P4, C4} is n>4.