Minor obstructions for apex-pseudoforests - Laboratoire d'Informatique de Paris-Nord Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2021

Minor obstructions for apex-pseudoforests

Résumé

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.
Fichier principal
Vignette du fichier
1811.06761.pdf (742.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03327317 , version 1 (22-10-2021)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More