Minor obstructions for apex-pseudoforests

Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Article number112529
JournalDiscrete Mathematics
Issue number10
StatePublished - Oct 2021


  • Graph minors
  • Minor obstructions

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Minor obstructions for apex-pseudoforests'. Together they form a unique fingerprint.

Cite this