A coloring problem for weighted graphs, Information Processing Letters, vol.61, issue.2, pp.77-81, 1997. ,
DOI : 10.1016/S0020-0190(97)00002-1
Perfect graphs, 1985. ,
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation, Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC), ser, pp.896-907, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00004074
Weighted node coloring: when stable sets are expensive, Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), ser, pp.114-125, 2002. ,
Graph Theory, ser. Graduate Texts in Mathematics, 2008. ,
Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1-3, pp.189-241, 1999. ,
DOI : 10.1016/S0012-365X(98)00319-7
Weighted Coloring: further complexity and approximability results, Information Processing Letters, vol.97, issue.3, pp.98-103, 2006. ,
DOI : 10.1016/j.ipl.2005.09.013
URL : https://hal.archives-ouvertes.fr/hal-00116712
Recognizing $P_4 $-Sparse Graphs in Linear Time, SIAM Journal on Computing, vol.21, issue.2, pp.381-406, 1992. ,
DOI : 10.1137/0221027
A fast parallel algorithm to recognize P4-sparse graphs, Discrete Applied Mathematics, vol.81, issue.1-3, pp.191-215, 1998. ,
DOI : 10.1016/S0166-218X(97)00085-1
Grundy Number on P 4 -classes, Proceedings of the 5th Latin-american Algorithms, Graphs and Optimization Symposium (LAGOS), ser. Electronic Notes in Discrete Mathematics, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00531691
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations, Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), ser, pp.634-645, 2008. ,
DOI : 10.1007/978-3-540-70575-8_52
On extended P4-reducible and extended P4-sparse graphs, Theoretical Computer Science, vol.180, issue.1-2, pp.269-286, 1997. ,
DOI : 10.1016/S0304-3975(96)00220-4
URL : https://hal.archives-ouvertes.fr/hal-00467644