Skip to main content
Conference Proceedings

Clique and anticlique partitions of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1197 LNCS 67-72
DOI: 10.1007/3-540-62559-3_7
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 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.

Cite

CITATION STYLE

APA

Bryś, K., & Lonc, Z. (1997). Clique and anticlique partitions of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1197 LNCS, pp. 67–72). https://doi.org/10.1007/3-540-62559-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free