An overview of universal obstructions for graph parameters
From MaRDI portal
Cites work
- 103 graphs that are irreducible for the projective plane
- k-apices of minor-closed graph classes. I: Bounding the obstructions
- \textsc{max-cut} and containment relations in graphs
- A Framework for Minimal Hereditary Classes of Graphs of Unbounded Clique-Width
- A Kuratowski theorem for nonorientable surfaces
- A kuratowski theorem for the projective plane
- A note on well quasi-orderings for powersets
- A partial k-arboretum of graphs with bounded treewidth
- A polynomial excluded-minor approximation of treedepth
- A tight Erdős-Pósa function for planar minors
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- All minor-minimal apex obstructions with connectivity two
- Approximating clique-width and branch-width
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Are there any good digraph width measures?
- Beiträge zur Analysis situs. I.
- Between clique-width and linear clique-width of bipartite graphs
- Block elimination distance
- Branch-depth: generalizing tree-depth of graphs
- Call routing and the ratcatcher
- Circle graph obstructions
- Circumference and pathwidth of highly connected graphs
- Conway's ZIP Proof
- Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
- Delineating half-integrality of the Erdős-Pósa property for minors: the case of surfaces
- Edge degeneracy: algorithmic and structural results
- Edge-treewidth: algorithmic and combinatorial properties
- Excluded-minor characterization of apex-outerplanar graphs
- Excluding a ladder
- Excluding a long double path minor
- Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
- Finding Branch-Decompositions and Rank-Decompositions
- Finding topological subgraphs is fixed-parameter tractable
- Fixed-parameter tractable distances to sparse graph classes
- Forbidden minors to graphs with small feedback sets
- Forbidden minors: finding the finite few
- Graph isomorphism parameterized by elimination distance to bounded degree
- Graph minors and parameterized algorithm design
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graph minors. I. Excluding a forest
- Graph minors. III. Planar tree-width
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XVI: Excluding a non-planar graph
- Graph minors. XX: Wagner's conjecture
- Graph parameters, universal obstructions, and WQO
- Graph searching and a min-max theorem for tree-width
- Graph theory
- Graph Theory and Probability
- Graphs of bounded depth‐2 rank‐brittleness
- Graphs of small rank-width are pivot-minors of graphs of small tree-width
- Graphs on surfaces
- Graphs with small bandwidth and cutwidth
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handle-rewriting hypergraph grammars
- Hereditary classes of graphs: a parametric approach
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 5764786 (Why is no real title available?)
- scientific article; zbMATH DE number 3917707 (Why is no real title available?)
- scientific article; zbMATH DE number 176761 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 475621 (Why is no real title available?)
- scientific article; zbMATH DE number 1543076 (Why is no real title available?)
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- scientific article; zbMATH DE number 1870231 (Why is no real title available?)
- scientific article; zbMATH DE number 3400958 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- scientific article; zbMATH DE number 7829295 (Why is no real title available?)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- Infinitely many minimal classes of graphs of unbounded clique-width
- Interval graphs and searching
- Kernelization for feedback vertex set via elimination distance to a forest
- Killing a vortex
- Layout of Graphs with Bounded Tree-Width
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Linear time solvable optimization problems on graphs of bounded clique-width
- Minimal classes of graphs of unbounded clique-width
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Mixed searching and proper-path-width
- More forbidden minors for wye-delta-wye reducibility
- Nonserial dynamic programming
- Obstructions for bounded shrub-depth and rank-depth
- Obstructions for linear rank-width at most 1
- On a problem of formal logic.
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- On strict brambles
- On tree-partition-width
- On tree-partitions of graphs
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- Packing and covering immersion-expansions of planar sub-cubic graphs
- Parameters tied to treewidth
- Polynomial bounds for the grid-minor theorem
- Quickly excluding a forest
- Quickly excluding a planar graph
- Rank-width: algorithmic and structural results
- Sachs' linkless embedding conjecture
- Scattered classes of graphs
- Searching and pebbling
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
- Seymour's conjecture on 2-connected graphs of large pathwidth
- Six variations on a theme: almost planar graphs
- Slim tree-cut width
- Some results on tree decomposition of graphs
- Square roots of minor closed graph classes
- Tangles, tree-decompositions and grids in matroids
- The \(K_{n+5}\) and \(K_{3^2,1^n}\) families and obstructions to \(n\)-apex.
- The average cut-rank of graphs
- The directed grid theorem
- The disjoint paths problem in quadratic time
- The grid theorem for vertex-minors
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The structure of graphs not admitting a fixed immersion
- The vertex separation number of a graph equals its path-width
- Towards tight(er) bounds for the excluded grid theorem
- Tree-depth, subgraph coloring and homomorphism bounds
- Tree-partitions of infinite graphs
- Tree-width dichotomy
- Unavoidable vertex-minors in large prime graphs
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Upper bounds on the size of obstructions and intertwines
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- Über eine Eigenschaft der ebenen Komplexe
This page was built for publication: An overview of universal obstructions for graph parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304683)
