Skip to Main content Skip to Navigation
Journal articles

Minor obstructions for apex-pseudoforests

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.
Document type :
Journal articles
Complete list of metadata
Contributor : Dimitrios Thilikos Connect in order to contact the contributor
Submitted on : Friday, October 22, 2021 - 10:25:49 AM
Last modification on : Wednesday, October 27, 2021 - 4:15:01 PM


Files produced by the author(s)



Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis. Minor obstructions for apex-pseudoforests. Discrete Mathematics, Elsevier, 2021, 344 (10), pp.112529. ⟨10.1016/j.disc.2021.112529⟩. ⟨hal-03327317⟩



Les métriques sont temporairement indisponibles