Vertex-minors of graphs: a survey
From MaRDI portal
Publication:6495258
Recommendations
Cites work
- scientific article; zbMATH DE number 4202305 (Why is no real title available?)
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 15493 (Why is no real title available?)
- scientific article; zbMATH DE number 26598 (Why is no real title available?)
- scientific article; zbMATH DE number 7029306 (Why is no real title available?)
- scientific article; zbMATH DE number 808801 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- scientific article; zbMATH DE number 4183450 (Why is no real title available?)
- An efficient algorithm to recognize locally equivalent graphs
- Approximating clique-width and branch-width
- Branch-depth: generalizing tree-depth of graphs
- Circle graph obstructions
- Circle graph obstructions under pivoting
- Circle graphs are quadratically χ‐bounded
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Computing small pivot-minors
- Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
- Decomposition of Directed Graphs
- Decomposition of regular matroids
- Distance-hereditary graphs
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- Excluding a bipartite circle graph from line graphs
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Graph minors XXIII. Nash-Williams' immersion conjecture
- 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 polynomials derived from Tutte-Martin polynomials
- Graph structure and monadic second-order logic. A language-theoretic approach
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- Graphic presentations of isotropic systems
- Graphs of bounded cliquewidth are polynomially \(\chi\)-bounded
- Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded
- Graphs of small rank-width are pivot-minors of graphs of small tree-width
- Graphs on surfaces
- Greedy algorithm and symmetric matroids
- Improved bounds for colouring circle graphs
- Interlace polynomials
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors
- Isotropic matroids. II: Circle graphs
- Isotropic systems
- Linear rank-width and linear clique-width of trees
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
- Linear time split decomposition revisited
- Local complementation and interlacement graphs
- Menger's theorem for matroids
- Minimally 3-connected isotropic systems
- Obstructions for bounded shrub-depth and rank-depth
- Obstructions for linear rank-width at most 1
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
- On Rota's conjecture and excluded minors containing large projective geometries.
- On the chromatic number of multiple interval graphs and overlap graphs
- On the connectivity function of a matroid
- On the interlace polynomials
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
- Planar Graphs
- Prime vertex-minors of a prime graph
- Ramsey-type theorems
- Rank connectivity and pivot-minors of graphs
- Rank-Width and Well-Quasi-Ordering
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- Rank-width: algorithmic and structural results
- Rank‐width is less than or equal to branch‐width
- Recognizing circle graphs in polynomial time
- Reducing prime graphs and recognizing circle graphs
- Solving Rota's conjecture
- The branchwidth of graphs and their cycle matroids
- The complexity of the vertex-minor problem
- The grid theorem for vertex-minors
- The interlace polynomial and the Tutte–Martin polynomial
- The interlace polynomial of a graph
- The relative clique-width of a graph
- Thread graphs, linear rank-width and their algorithmic applications
- Transforming trees by successive local complementations
- Tree pivot-minors and linear rank-width
- Tree-depth and vertex-minors
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- Twin-width. I: Tractable FO model checking
- Unavoidable vertex-minors in large prime graphs
- Unimodularity and circle graphs
- Upper bounds to the clique width of graphs
- Vertex-minors and the Erdős-Hajnal conjecture
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\)
This page was built for publication: Vertex-minors of graphs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495258)
