Outerplanar obstructions for a feedback vertex set
From MaRDI portal
Publication:412287
DOI10.1016/J.EJC.2011.09.018zbMATH Open1239.05174OpenAlexW2120288086MaRDI QIDQ412287FDOQ412287
Authors: Juanjo Rué, Konstantinos S. Stavropoulos, Dimitrios M. Thilikos 
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.018
Recommendations
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph minors (05C83)
Cites Work
- Singularity Analysis of Generating Functions
- Title not available (Why is that?)
- Graph minors. XX: Wagner's conjecture
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Algorithms and obstructions for linear-width and related search parameters
- Title not available (Why is that?)
- On an asymptotic method in enumeration
- On obstructions to small face covers in planar graphs
- Outerplanar obstructions for the feedback vertex set
- Obstructions for tree-depth
- Title not available (Why is that?)
- Forbidden minors to graphs with small feedback sets
Cited In (10)
- Forbidding Kuratowski Graphs as Immersions
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Minor-obstructions for apex sub-unicyclic graphs
- Characterizing graphs of small carving-width
- Obstruction sets for outer-cylindrical graphs
- Minor obstructions for apex-pseudoforests
- Minor-obstructions for apex sub-unicyclic graphs
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders
- Obstructions to within a few vertices or edges of acyclic
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
This page was built for publication: Outerplanar obstructions for a feedback vertex set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412287)
