Pages that link to "Item:Q1028455"
From MaRDI portal
The following pages link to Graph operations characterizing rank-width (Q1028455):
Displaying 13 items.
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs (Q449209) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions (Q3508555) (← links)
