Title of article
Generalized partitions of graphs Original Research Article
Author/Authors
Gary MacGillivray، نويسنده , , Min-Li Yu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
11
From page
143
To page
153
Abstract
A general graph partitioning problem, which includes graph colouring, homomorphism to H, conditional colouring, contractibility to H, and partition into cliques as special cases, is introduced and its complexity is studied.
Keywords
Algorithm , NP-complete , Conditional colouring , Complexity , 2-sat
Journal title
Discrete Applied Mathematics
Serial Year
1999
Journal title
Discrete Applied Mathematics
Record number
884865
Link To Document