Clique partitions and clique coverings
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
On the maximum number of independent cycles in a graph
Discrete Mathematics
Graph Theory With Applications
Graph Theory With Applications
How many graphs are unions of k-cliques?
Journal of Graph Theory
| Hi-index | 0.04 |
Let s and k be two integers with 0@?s@?k and let G be a simple graph of order n. This paper investigates clique partition problems. It is proved that if n=3s+4(k-s) and d(u)+d(v)=3(n-s)/2+k-1 for any pair of non-adjacent vertices u,v of G, then G contains s vertex-disjoint K"3s and k-s vertex-disjoint K"4s such that all of them are vertex-disjoint. Moreover, the degree condition is sharp.