Clique and anticlique partitions of graphs
Krzysztof Bryś , Zbigniew Lonc
AbstractIn the paper we prove that, for a fixed k, the problem of deciding whether a graph admits a partition of its vertex set into k-element cliques or anticliques (i.e. independent sets) is polynomial.
|Journal series||Discrete Mathematics, ISSN 0012-365X|
|Publication indicators||: 2006 = 0.347 (2) - 2007=0.501 (5)|
|Citation count*||3 (2015-02-23)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.