C. Bazgan, C. Bentz, C. Picouleau, and B. Ries, Blockers for the stability number and the chromatic number, Graphs and Combinatorics, vol.31, pp.73-90, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01505546

C. Bazgan, S. Toubaline, and Z. Tuza, The most vital nodes with respect to independent set and vertex cover, Discrete Applied Mathematics, vol.159, pp.1933-1946, 2011.

C. Bentz, M. Costa, D. De-werra, C. Picouleau, and B. Ries, Weighted transversals and blockers for some optimization problems in graphs, Progress in Combinatorial Optimization, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01125938

D. Bruce, C. T. Hoàng, and J. Sawada, A certifying algorithm for 3-colorability of P5-free graphs, Lecture Notes in Computer Science, vol.5878, pp.595-604, 2009.

M. Chudnovsky, J. Goedgebeur, O. Schaudt, and M. Zhong, Obstructions for threecoloring and list three-coloring H-free graphs

M. Chudnovsky, J. Goedgebeur, O. Schaudt, and M. Zhong, Obstructions for threecoloring graphs without induced paths on six vertices, Proc. SODA 2016, pp.1774-1783

M. Costa, D. De-werra, and C. Picouleau, Minimum d-blockers and d-transversals in graphs, Journal of Combinatorial Optimization, vol.22, pp.857-872, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00973849

H. S. Dhaliwal, A. M. Hamel, C. T. Hoàng, F. Maffray, T. J. Mcconnell et al., On color-critical (P5, P5)-free graphs, Discrete Applied Mathematics, vol.216, pp.142-148, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01437482

O. Diner, D. Paulusma, C. Picouleau, and B. Ries, Contraction blockers for graphs with forbidden induced paths, Proc. CIAC 2015, vol.9079, pp.194-207, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01338229

J. Goedgebeur and O. Schaudt, Exhaustive generation of k-critical H-free graphs, Journal of Graph Theory, vol.87, pp.188-207, 2018.

P. A. Golovach, M. Johnson, D. Paulusma, and J. Song, A survey on the computational complexity of colouring graphs with forbidden subgraphs, Journal of Graph Theory, vol.84, pp.331-363, 2017.

P. Hell and S. Huang, Complexity of coloring graphs without paths and cycles, vol.216, pp.211-232, 2017.

C. T. Hoàng, B. Moore, D. Recoskie, J. Sawada, and M. Vatshelle, Constructions of kcritical P5-free graphs, vol.182, pp.91-98, 2015.

D. Král, &. , J. Kratochvíl, Z. Tuza, and G. J. Woeginger, Complexity of coloring graphs without forbidden induced subgraphs, Proc. WG, vol.2204, pp.254-262, 2001.

L. Lovász, Coverings and coloring of hypergraphs, Proc. 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, pp.3-12, 1973.

F. Maffray and G. Morel, On 3-Colorable P5-free graphs, SIAM Journal on Discrete Mathematics, vol.26, pp.1682-1708, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00795190

F. Maffray and M. Preissmann, On the NP-completeness of the k-colorability problem for triangle-free graphs, Discrete Mathematics, vol.162, pp.313-317, 1996.

C. Moore and J. M. Robson, Hard tiling problems with simple tiles, Discrete and Computational Geometry, vol.26, pp.573-590, 2001.

F. M. Pajouh, V. Boginski, and E. L. Pasiliao, Minimum vertex blocker clique problem, Networks, vol.64, pp.48-64, 2014.

D. Paulusma, C. Picouleau, and B. Ries, Reducing the chromatic number by vertex or edge deletions, Proc. LAGOS 2017, Electronic Notes in Discrete Mathematics, vol.62, pp.243-248, 2017.

D. Paulusma, C. Picouleau, and B. Ries, Reducing the clique and chromatic number via edge contractions and vertex deletions, Proc. ISCO 2016, vol.9849, pp.38-49, 2016.

D. Paulusma, C. Picouleau, and B. Ries, Blocking independent sets for H-free graphs via edge contractions and vertex deletions, Proc. TAMC 2017, vol.10185, pp.470-483, 2017.

B. Ries, C. Bentz, C. Picouleau, D. De-werra, M. Costa et al., Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid, vol.310, pp.132-146, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00974959

D. B. West, Introduction to Graph Theory, 1996.