Minor-Obstructions for Apex Sub-unicyclic Graphs

Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +3

A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph $G$ is $k$-apex sub-unicyclic if it can become sub-unicyclic by removing $k$ of its vertices. We…