Sparse obstructions for minor-covering parameters
From MaRDI portal
Publication:2174553
Recommendations
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Improved sparse covers for graphs excluding a fixed minor
- scientific article; zbMATH DE number 176214
- Extremal density for sparse minors and subdivisions
- scientific article; zbMATH DE number 5583574
- Extremal functions for sparse minors
- On computing graph minor obstruction sets
- Minimal covers and filter spaces
- Minimal obstructions for partial representations of interval graphs
- Minimal obstructions for partial representations of interval graphs
Cites work
- scientific article; zbMATH DE number 5764786 (Why is no real title available?)
- scientific article; zbMATH DE number 1323192 (Why is no real title available?)
- scientific article; zbMATH DE number 475614 (Why is no real title available?)
- scientific article; zbMATH DE number 1543076 (Why is no real title available?)
- scientific article; zbMATH DE number 1554933 (Why is no real title available?)
- scientific article; zbMATH DE number 1870231 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- (Meta) kernelization
- 103 graphs that are irreducible for the projective plane
- A Menger-like property of tree-width: The finite case
- A kuratowski theorem for the projective plane
- Algorithms and obstructions for linear-width and related search parameters
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Bidimensionality and kernels
- Contraction obstructions for connected graph searching
- Cutwidth: obstructions and algorithmic aspects
- Data-compression for parametrized counting problems on sparse graphs
- Excluded grid theorem: improved and simplified
- Excluded-minor characterization of apex-outerplanar graphs
- FPT is characterized by useful obstruction sets
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Forbidden graphs for tree-depth
- Forbidden minors characterization of partial 3-trees
- Forbidden minors to graphs with small feedback sets
- Fundamentals of parameterized complexity
- Graph minors. XX: Wagner's conjecture
- Graphs with Branchwidth at Most Three
- Highly connected sets and the excluded grid theorem
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width
- Minor‐order obstructions for the graphs of vertex cover 6
- Obstruction set isolation for the gate matrix layout problem
- Obstructions of connectivity two for embedding graphs into the torus
- Outerplanar obstructions for matroid pathwidth
- Outerplanar obstructions for the feedback vertex set
- Parameterized algorithms
- Parametrized complexity theory.
- Polynomial bounds for the grid-minor theorem
- Properties of vertex cover obstructions
- Properties of vertex packing and independence system polyhedra
- Quickly excluding a planar graph
- Reduction algorithms for graphs of small treewidth
- The Structure and Number of Obstructions to Treewidth
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The obstructions for toroidal graphs with no \(K_{3,3}\)'s
- The structure of obstructions to treewidth and pathwidth
- Treewidth. Computations and approximations
- Upper bounds on the size of obstructions and intertwines
Cited in
(5)- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Achievable sets, brambles, and sparse treewidth obstructions
- Faster parameterized algorithms for modification problems to minor-closed classes
- scientific article; zbMATH DE number 1696634 (Why is no real title available?)
- Improved sparse covers for graphs excluding a fixed minor
This page was built for publication: Sparse obstructions for minor-covering parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174553)
