A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apexpseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that form the minor obstruction set of the class of apexpseudoforests, i.e., the set of all minorminimal graphs that are not apexpseudoforests.
Date of Defense
Archontia C. Giannopoulou (Advisor)