The following pages link to Rank-width and vertex-minors (Q2565688):
Displaying 50 items.
- Tree-depth and vertex-minors (Q281932) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry (Q306575) (← links)
- Graph reductions, binary rank, and pivots in gene assembly (Q411856) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- Several notions of rank-width for countable graphs (Q505916) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Block-graph width (Q534563) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- The group structure of pivot and loop complementation on graphs and set systems (Q648991) (← links)
- Pivots, determinants, and perfect matchings of graphs (Q714808) (← links)
- Isotropic matroids. I: Multimatroids and neighborhoods (Q727168) (← links)
- Unavoidable vertex-minors in large prime graphs (Q740266) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Rainbow independent sets on dense graph classes (Q831859) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- On an extension of distance hereditary graphs (Q1025561) (← links)
- Circle graphs and the cycle double cover conjecture (Q1025572) (← links)
- Graph operations characterizing rank-width (Q1028455) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Vertex-minors and the Erdős-Hajnal conjecture (Q1800420) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Obstructions for bounded shrub-depth and rank-depth (Q2033913) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- The complexity of the vertex-minor problem (Q2059901) (← links)
- Characterizing matroids whose bases form graphic delta-matroids (Q2066014) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- The grid theorem for vertex-minors (Q2099410) (← links)
- Rank connectivity and pivot-minors of graphs (Q2107500) (← links)
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width (Q2121810) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- Subgraph complementation (Q2182091) (← links)
- The average cut-rank of graphs (Q2225395) (← links)
