Outerplanar obstructions for a feedback vertex set
From MaRDI portal
(Redirected from Publication:412287)
Recommendations
Cites work
- scientific article; zbMATH DE number 3650583 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 1543076 (Why is no real title available?)
- Algorithms and obstructions for linear-width and related search parameters
- Forbidden minors to graphs with small feedback sets
- Graph minors. XX: Wagner's conjecture
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Obstructions for tree-depth
- On an asymptotic method in enumeration
- On obstructions to small face covers in planar graphs
- Outerplanar obstructions for the feedback vertex set
- Singularity Analysis of Generating Functions
Cited in
(11)- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
- Obstruction sets for outer-cylindrical graphs
- FPT is characterized by useful obstruction sets: connecting algorithms, kernels, and quasi-orders
- Minor obstructions for apex-pseudoforests
- Minor-obstructions for apex sub-unicyclic graphs
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Minor-obstructions for apex sub-unicyclic graphs
- Obstructions to within a few vertices or edges of acyclic
- Outerplanar obstructions for the feedback vertex set
- Characterizing graphs of small carving-width
- Forbidding Kuratowski graphs as immersions
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)
