1 paper · 1 filter
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…