Minor-Obstructions for Apex-Pseudoforests
Combinatorics
2022-09-13 v6
Abstract
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.
Cite
@article{arxiv.1811.06761,
title = {Minor-Obstructions for Apex-Pseudoforests},
author = {Alexandros Leivaditis and Alexandros Singh and Giannos Stamoulis and Dimitrios M. Thilikos and Konstantinos Tsatsanis},
journal= {arXiv preprint arXiv:1811.06761},
year = {2022}
}