New Results on Generalized Graph Coloring

For graph classes \wp_1,...,\wp_k, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph G can be partitioned into subsets V_1,...,V_k so that V_j induces a graph in the class \wp_j (j=1,2,...,k). If \wp_1=...=\wp_k is the class of edgeless graphs, then this problem coincides with the standard vertex k-COLORABILITY, which is known to be NP-complete for any k≥ 3. Recently, this result has been generalized by showing that if all \wp_i's are additive hereditary, then the generalized graph coloring is NP-hard, with the only exception of bipartite graphs. Clearly, a similar result follows when all the \wp_i's are co-additive.

[1]  Jan Kratochvíl,et al.  On the computational complexity of (O, P)-partition problems , 1997, Discuss. Math. Graph Theory.

[2]  Demetrios Achlioptas,et al.  The complexity of G-free colourability , 1997, Discret. Math..

[3]  Peter L. Hammer,et al.  Bisplit graphs , 2005, Discret. Math..

[4]  A. A. Chernyak,et al.  About recognizing (a b) classes of polar graphs , 1986 .

[5]  Marietjie Frick,et al.  A survey of hereditary properties of graphs , 1997, Discuss. Math. Graph Theory.

[6]  Alastair Farrugia.  Vertex-Partitioning into Fixed Additive Induced-Hereditary Properties is NP-hard , 2004, Electron. J. Comb..

[7]  R. Bruce Richter,et al.  Unique factorisation of additive induced-hereditary properties , 2004, Discuss. Math. Graph Theory.

[8]  Jason I. Brown.  The Complexity of Generalized Graph Colorings , 1996, Discret. Appl. Math..

[9]  Andreas Brandstädt,et al.  The Complexity of some Problems Related to Graph 3-colorability , 1998, Discret. Appl. Math..

[10]  G. R. Vijayakumar,et al.  Hereditary properties of graphs , 1999, Discret. Math..

[11]  Sulamita Klein,et al.  Complexity of graph partition problems , 1999, STOC '99.

[12]  Russell Merris,et al.  Split graphs , 2003, Eur. J. Comb..

[13]  Peter Mihók,et al.  Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties , 2002, Discuss. Math. Graph Theory.

[14]  Peter Mihók,et al.  Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors , 2000, J. Graph Theory.

[15]  Leizhen Cai,et al.  A generalization of perfect graphs - i-perfect graphs , 1996, J. Graph Theory.

[16]  J. Spencer.  Ramsey Theory , 1990 .

[17]  R. Bruce Richter,et al.  Uniqueness and complexity in generalised colouring , 2003 .

[18]  Peter Mihók,et al.  Unique factorization theorem , 2000, Discuss. Math. Graph Theory.

[19]  R. Bruce Richter,et al.  Factorizations and characterizations of induced-hereditary and compositive properties , 2003 .