Bonomo, F., Chudnovsky, M., Maceli, P., Schaudt, O., Stein, M., Zhong, M., Three-coloring and list three-coloring graphs without induced paths on seven vertices. Combinatorica 38:4 (2018), 779–801.
Brinkmann, G., Coolsaet, K., Goedgebeur, J., Mélot, H., House of graphs: a database of interesting graphs. Discrete Appl. Math. 161:1–2 (2013), 311–314 available at http://hog.grinvin.org/.
Bruce, D., Hoàng, C.T., Sawada, J., A certifying algorithm for 3-colorability of P5-free graphs. Proceedings of the 20th International Symposium on Algorithms and Computation, 2009, Springer-Verlag, 594–604.
Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R., The strong perfect graph theorem. Ann. of Math. 164:1 (2006), 51–229.
Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M., Obstructions for three-coloring graphs with one forbidden induced subgraph. Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, 2016, 1774–1783.
Erdős, P., Graph theory and probability. Canad. J. Math. 11 (1959), 34–38.
Goedgebeur, J., Homepage of generator for 4-critical Pt-free graphs. http://caagt.ugent.be/criticalpfree/.
Goedgebeur, J., Homepage of generator for 4-critical Pt-free 1-vertex extensions of tripods. http://caagt.ugent.be/tripods/.
Goedgebeur, J., Schaudt, O., Exhaustive generation of k-critical H-free graphs. J. Graph Theory 87:2 (2018), 188–207.
Golovach, P.A., Johnson, M., Paulusma, D., Song, J., A survey on the computational complexity of coloring graphs with forbidden subgraphs. J. Graph Theory 84:4 (2017), 331–363.
Hell, P., Huang, S., Complexity of coloring graphs without paths and cycles. LATIN 2014: Theoretical Informatics, 2014, Springer, 538–549.
Hoàng, C.T., Moore, B., Recoskie, D., Sawada, J., Vatshelle, M., Constructions of k-critical P5-free graphs. Discrete Appl. Math. 182 (2015), 91–98.
Lazebnik, F., Ustimenko, V.A., Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Appl. Math. 60 (1995), 275–284.
B.D. McKay, Nauty User's Guide (Version 2.5), Technical Report TR-CS-90-02, Department of Computer Science, Australian National University, the latest version of the software is available at http://cs.anu.edu.au/~bdm/nauty.
McKay, B.D., Piperno, A., Practical graph isomorphism, II. J. Symbolic Comput. 60 (2014), 94–112.
A. Pokrovskiy, private communication.
Randerath, B., Schiermeyer, I., Tewes, M., Three-colorability and forbidden subgraphs. II: polynomial algorithms. Discrete Math. 251 (2002), 137–153.
P. Seymour, Barbados workshop on graph coloring and structure, 2014.
Sloane, N., The on-line encyclopedia of integer sequences. http://oeis.org/.
