1. Barefoot, C.A., Entringer, R.C., Swart, H.C.: Vulnerability in graphs–a comparative survey. J. Comb. Math. Comb. Comput. 1, 13–22 (1987)
2. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Technical report TR03-049, Electronic Colloquium on Computational Complexity (ECCC) (2003)
3. Bodlaender, H.L., Nederlof, J., van der Zanden, T.C.: Subexponential time algorithms for embedding
$$H$$
-minor free graphs. In: ICALP 2016. LIPIcs, vol. 55, pp. 9:1–9:14 (2016)
4. Bonsma, P.: Surface split decompositions and subgraph isomorphism in graphs on surfaces. In: STACS 2012. LIPIcs, vol. 14, pp. 531–542 (2012)
5. Cygan, M., et al.: Tight lower bounds on graph embedding problems. J. ACM 64(3), 18:1–18:22 (2017)