D. Achlioptas, The complexity of G-free colorability, Discrete Math, pp.21-30, 1997.

M. Borowiecki, I. Broere, M. Frick, P. Mih´okmih´, G. Mih´ok et al., A survey of hereditary properties of graphs, Discussiones Mathematicae Graph Theory, vol.17, issue.1, pp.5-50, 1997.
DOI : 10.7151/dmgt.1037

M. Borowiecki, P. Mih´okmih´, and . Mih´ok, Hereditary properties of graphs Advances in Graph Theory, pp.42-69, 1991.

A. Brandst¨adtbrandst¨-brandst¨adt, V. B. Le, and T. Szymczak, The complexity of some problems related to Graph 3-colorability, Discrete Applied Mathematics, vol.89, issue.1-3, pp.59-73, 1998.
DOI : 10.1016/S0166-218X(98)00116-4

I. Broere and J. Bucko, Divisibility in additive hereditary properties and uniquely partitionable graphs, Tatra Mt, Math. Publ, vol.18, pp.79-87, 1999.

I. Broere, B. Bucko, P. Mih´okmih´, and . Mih´ok, Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties, Discussiones Mathematicae Graph Theory, vol.22, issue.1, pp.31-37, 2002.
DOI : 10.7151/dmgt.1156

J. Brown, The complexity of generalized graph colorings, Discrete Applied Mathematics, vol.69, issue.3, pp.257-270, 1996.
DOI : 10.1016/0166-218X(96)00096-0

Z. A. Chernyak and A. A. Chernyak, About recognizing (?, ?) classes of polar graphs, Discrete Math, pp.133-138, 1986.

L. Cai and D. G. Corneil, A generalization of perfect graphs?i-perfect graphs, Journal of Graph Theory, vol.23, issue.1, pp.87-103, 1996.
DOI : 10.1002/(SICI)1097-0118(199609)23:1<87::AID-JGT10>3.0.CO;2-H

A. Farrugia, Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard, submitted to Electron, J. Combin

A. Farrugia, Uniqueness and complexity in generalised colouring, 2003.

A. Farrugia, P. Mih´okmih´-mih´ok, R. B. Richter, and G. Semani?insemani?semani?in, Factorisations and characterisations of induced-hereditary and compositive properties

A. Farrugia and R. B. Richter, Unique factorization of additive induced-hereditary properties

T. Feder, P. Hell, S. Klein, and R. Motwani, Complexity of graph partition problems, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.464-472, 1999.
DOI : 10.1145/301250.301373

J. Kratochv´ilkratochv´il and I. Schiermeyer, On the computational complexity of (O,P)-partition problems, Discussiones Mathematicae Graph Theory 17, pp.253-258, 1997.

O. Mel-'nikov and P. P. Kozhich, Algorithms for recognizing the polarity of a graph with bounded parameters, Izvestia Akad, Nauk BSSR, ser. Fiz. Mat. Nauk, vol.6, pp.50-54, 1985.

P. Mih´okmih´ and . Mih´ok, Unique factorization theorem, Discussiones Mathematicae Graph Theory, vol.20, issue.1, pp.143-153, 2000.
DOI : 10.7151/dmgt.1114

P. Mih´okmih´-mih´ok, G. Semani?insemani?semani?in, and R. Vasky, Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors, Journal of Graph Theory, vol.17, issue.1, pp.44-53, 2000.
DOI : 10.1002/(SICI)1097-0118(200001)33:1<44::AID-JGT5>3.0.CO;2-O

R. I. Tyshkevich and A. A. Chernyak, Algorithms for the canonical decomposition of a graph and recognizing polarity, Izvestia Akad, Nauk BSSR, ser. Fiz.-Mat. Nauk, vol.6, pp.16-23, 1985.