1. Abdullah, A. (1992). On graph bipartization. In: ISCAS ’92 (Vol. 4, pp. 1847–1850)
2. Agrawal, A., Jain, P., Kanesh, L., Misra, P., & Saurabh, S. (2019). Exploring the Kernelization Borders for Hitting Cycles. In: 13th international symposium on parameterized and exact computation (IPEC 2018), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, Leibniz International Proceedings in Informatics (LIPIcs) (Vol. 115, pp. 14:1–14:14).
3. Alon, N., & Stav, U. (2009). Hardness of edge-modification problems. Theoretical Computer Science, 410(47–49), 4920–4927.
4. Andrews, J., & Jacobson, M. (1985). On a generalization of chromatic number. In: Proc. sixteenth southeastern international conference on combinatorics, graph theory and computing (Vol. 47, pp. 18–33).
5. Angelini, P., Bekos, M. A., De Luca, F., Didimo, W., Kaufmann, M., Kobourov, S., et al. (2017). Vertex-coloring with defects. Journal of Graph Algorithms and Applications, 21(3), 313–340.