Title of article
2K2-Partition Problem
Author/Authors
Campos، نويسنده , , C.N. and Dantas، نويسنده , , S. and Faria، نويسنده , , L. and Gravier، نويسنده , , S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
5
From page
217
To page
221
Abstract
A 2 K 2 -partition of a graph is a partition of its vertex set in four (nonempty) parts a, b, c, d such that each vertex of a is adjacent to every vertex of b, and each vertex of c is adjacent to every vertex of d. We show that determining if a graph G admits a 2 K 2 -partition is NP-complete. This result completely classify the H-Partition Problems. Moreover, the 2 K 2 -Partition Problem is the only NP-complete.
Keywords
computational complexity , Partition problems , NP-Completeness
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454132
Link To Document