Computing pivot-minors
From MaRDI portal
Cites work
- Approximating clique-width and branch-width
- Certifying algorithms
- Circle graph obstructions
- Circle graph obstructions under pivoting
- Complement reducible graphs
- Computing small pivot-minors
- Contractibility and NP-completeness
- Detecting an Odd Hole
- Detecting induced subgraphs
- Excluding a bipartite circle graph from line graphs
- Finding topological subgraphs is fixed-parameter tractable
- Graph minors. XIII: The disjoint paths problem
- Graphic presentations of isotropic systems
- Graphs of small rank-width are pivot-minors of graphs of small tree-width
- scientific article; zbMATH DE number 4202305 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 5057511 (Why is no real title available?)
- Induced-minor-free graphs: separator theorem, subexponential algorithms, and improved hardness of recognition
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Obstructions for bounded shrub-depth and rank-depth
- On graph contractions and induced minors
- On graphs with no induced subdivision of \(K_4\)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Rank-width and vertex-minors
- Rank-Width and Well-Quasi-Ordering
- Rank-width: algorithmic and structural results
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- The complexity of induced minors and related problems
- The complexity of the vertex-minor problem
- The grid theorem for vertex-minors
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Tree pivot-minors and linear rank-width
- Vertex-minors of graphs: a survey
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
This page was built for publication: Computing pivot-minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7255557)
