Minor­-Obstructions for Apex Pseudoforests

Submitted by admin on Sat, 12/03/2022 - 11:01
Konstantinos Tsatsanis
Date of Defense
Three-member Committee
Archontia C. Giannopoulou (Advisor)
Stavros Kolliopoulos
Dimitris Zoros

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 of its vertices. We identify 33 graphs that form the minor obstruction set of the class of apex­pseudoforests, i.e., the set of all minor­minimal graphs that are not apex­pseudoforests.