摘要
By an extended triangle, we mean a loop, a loop with an edge attached (known as a lollipop), or a copy of K (3) (known as a triangle). In this paper, we completely solve the problem of decomposing the graph (lambda K (upsilon) )( ) into extended triangles for all possible number of loops.
- 出版日期2009-4
- 单位苏州大学