2 papers
math.CO2019
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 is -apex sub-unicyclic if it can become sub-unicyclic by removing of its vertices. We…
math.CO2018
Minor-Obstructions for Apex-Pseudoforests
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +2
A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one o…