1. Agrawal, A., Gupta, S., Saurabh, S., Sharma, R.: Improved algorithms and combinatorial bounds for independent feedback vertex set. In: Proceedings of IPEC 2016, LIPIcs, vol. 63, pp. 2:1–2:14 (2017)
2. Akiyama, T., Nishizeki, T., Saito, N.: NP-Completeness of the Hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73–76 (1980)
3. Bacsó, G., Tuza, Zs: Dominating cliques in
$$P_5$$
P
5
-free graphs. Period. Math. Hung. 21(4), 303–308 (1990)
4. Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M., Paulusma, D.: Independent feedback vertex set for
$${P_5}$$
P
5
-free graphs. In: Proceedings of ISAAC 2017, LIPIcs, vol. 92, pp. 16:1–16:12 (2017)
5. Bonamy, M., Dabrowski, K.K., Feghali, C., Johnson, M., Paulusma, D.: Recognizing graphs close to bipartite graphs. In: Proceedings of MFCS 2017, LIPIcs, vol. 83, pp. 70:1–70:14 (2017)