Forbidden minors to graphs with small feedback sets

DOI10.1016/S0012-365X(00)00083-2zbMath0964.05064DBLPjournals/dm/DinneenCF01WikidataQ57360063 ScholiaQ57360063MaRDI QIDQ5931421

Kevin Cattell, Michael J. Dinneen, Michael R. Fellows

Publication date: 8 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

constructive methodfeedback setsgraph minor

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph minors (05C83)

Related Items (10)

Sparse obstructions for minor-covering parameters ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Outerplanar obstructions for a feedback vertex set ⋮ Confronting intractability via parameters ⋮ Properties of vertex cover obstructions ⋮ Minor obstructions for apex-pseudoforests ⋮ FPT is characterized by useful obstruction sets ⋮ Minor-obstructions for apex sub-unicyclic graphs ⋮ Outerplanar Obstructions for the Feedback Vertex Set ⋮ Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size

This page was built for publication: Forbidden minors to graphs with small feedback sets