Outerplanar obstructions for the vertex feedback set

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/104395

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtiques
dc.contributor	Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
dc.contributor.author	Rué Perna, Juan José
dc.contributor.author	Thilikos Touloupas, Dimitrios
dc.contributor.author	Stavropoulos, Konstantinos
dc.date	2012-07-02
dc.identifier.citation	Rue, J., Thilikos, D., Stavropoulos, K. Outerplanar obstructions for the vertex feedback set. "European journal of combinatorics", 2 Juliol 2012, vol. 33, núm. 5, p. 948-968.
dc.identifier.citation	0195-6698
dc.identifier.citation	10.1016/j.ejc.2011.09.018
dc.identifier.uri	http://hdl.handle.net/2117/104395
dc.language.iso	eng
dc.relation	info:eu-repo/grantAgreement/EC/FP7/208471/EU/Combinatorial methods, from enumerative topology to random discrete structures and compact data representations./EXPLOREMAPS
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject	MATHEMATICS / Combinatorics
dc.subject	Graph minors
dc.subject	outerplanar graphs
dc.subject	obstructions
dc.subject	feedback vertex set
dc.subject	enumeration
dc.subject	singularity analysis.
dc.subject	Grafs, Teoria de
dc.title	Outerplanar obstructions for the vertex feedback set
dc.type	info:eu-repo/semantics/submittedVersion
dc.type	info:eu-repo/semantics/article
dc.description.abstract	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

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author