Outerplanar obstructions for the vertex feedback set
For k = 1, let Fk be the class of graphs that contains k vertices meeting all its cycles. The minor-obstruction set for Fk is the set obs(Fk) containing all minor-minimal graphs that do not belong to Fk. We denote by Yk the set of all outerplanar graphs in obs(Fk). I
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2012 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/104395 |
| Acceso en línea: | https://hdl.handle.net/2117/104395 https://dx.doi.org/10.1016/j.ejc.2011.09.018 |
| Access Level: | acceso abierto |
| Palabra clave: | MATHEMATICS / Combinatorics Graph minors outerplanar graphs obstructions feedback vertex set enumeration singularity analysis. Grafs, Teoria de Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
| Sumario: | For k = 1, let Fk be the class of graphs that contains k vertices meeting all its cycles. The minor-obstruction set for Fk is the set obs(Fk) containing all minor-minimal graphs that do not belong to Fk. We denote by Yk the set of all outerplanar graphs in obs(Fk). I |
|---|