1. Chudnovsky, M., Stacho, J.: 3-colorable subclasses of $$P_8$$-free graphs. SIAM J. Discrete Math. 32(2), 1111–1138 (2018)
2. Daniel, D., Shauger, S.E.: A result on the Erdős–Gyárfás conjecture in planar graphs. In: Proceedings of the Thirty-second Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 153, pp. 129–139. Baton Rouge, LA (2001)
3. Erdős, P.: Some old and new problems in various branches of combinatorics. Graphs and combinatorics (Marseille, 1995). Discrete Math. 165(166), 227–231 (1997)
4. Ghaffari, M.H., Mostaghim, Z.: Erdős-Gyárfás conjecture for some families of Cayley graphs. Aequ. Math. 92(1), 1–6 (2018)
5. Ghasemi, M., Varmazyar, R.: On the Erdős–Gyárfás conjecture for some Cayley graphs. Matematichki Vesnik 73(1), 37–42 (2021)