Vertex-minors of graphs: a survey (Q6495258): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Obstructions for linear rank-width at most 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Rank-Width and Linear Clique-Width of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interlace polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally 3-connected isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interlace polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of bounded cliquewidth are polynomially $χ$-bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twin-width I: Tractable FO Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm and symmetric matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unimodularity and circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic presentations of isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming trees by successive local complementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to recognize locally equivalent graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte-Martin polynomials and orienting vectors of isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph polynomials derived from Tutte-Martin polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The interlace polynomial and the Tutte–Martin polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isotropic matroids. II: Circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Split Decomposition Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chi-boundedness of graph classes excluding wheel vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-minors and the Erdős-Hajnal conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-minors, monadic second-order logic, and a conjecture by Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing small pivot-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Pivot-Minors and Linear Rank-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting single-qubit Clifford equivalent graph states is #P-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the vertex-minor problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for colouring circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graphs are quadratically χ‐bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-depth: generalizing tree-depth of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs with small rank decompositions are \(\chi \)-bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local complementation and interlacement graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4625695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Grow Low: Shrubs and Fast MSO1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rota's conjecture and excluded minors containing large projective geometries. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Rota's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The grid theorem for vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions under pivoting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4860774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of multiple interval graphs and overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The branchwidth of graphs and their cycle matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded vertex-minors for graphs of linear rank-width at most \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime vertex-minors of a prime graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions for bounded shrub-depth and rank-depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of small rank-width are pivot-minors of graphs of small tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable vertex-minors in large prime graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intertwining Connectivities for Vertex-Minors and Pivot-Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative clique-width of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of graphs with low complexity: the case of classes with bounded linear rankwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Width and Well-Quasi-Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank‐width is less than or equal to branch‐width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a bipartite circle graph from line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width: algorithmic and structural results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank connectivity and pivot-minors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors XXIII. Nash-Williams' immersion conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity function of a matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interlace polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Menger's theorem for matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs / rank
 
Normal rank

Revision as of 13:33, 3 December 2024

scientific article; zbMATH DE number 7840909
Language Label Description Also known as
English
Vertex-minors of graphs: a survey
scientific article; zbMATH DE number 7840909

    Statements

    Vertex-minors of graphs: a survey (English)
    0 references
    0 references
    0 references
    30 April 2024
    0 references
    vertex-minor
    0 references
    prime graph
    0 references
    rank-width
    0 references
    local complementation
    0 references
    circle graph
    0 references
    interlace polynomial
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references