|
|||||
|
|
Graph partition into K 3s and K 4s |
|
| Authors: | Beibei Zhang Jin Yan |
| Institution: | 1. School of Mathematics, Shandong University, Jinan, 250100, People’s Republic of China |
| Abstract: | Let s and k be two integers with 0≤s≤k and let G be a simple graph of order n≥3s+4(k?s)+3. In this paper we prove that if σ 2(G)≥3(n?s)/2+k?2, then G ? sK 3+(k?s)K 4. We also show that the degree condition is sharp in some sense. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |