A graph is subunicyclic if it contains at most one cycle. A graph is k-apex subunicyclic if it can be made subunicyclic by removing k of its vertices. The purpose of this talk is to present a structural characterisation and an enumeration of the subset of obstructions for k-apex subunicyclicity consisting of cacti. To achieve the characterisation and enumeration of these cactus-obstructions, we made use of techniques and results from (structural) graph theory, enumerative and analytic combinatorics, and the theory of combinatorial species.
Date of Defense
Christos A. Athanasiadis
Dimitrios M. Thilikos (Advisor)