Pages that link to "Item:Q3000492"
From MaRDI portal
The following pages link to Thread Graphs, Linear Rank-Width and Their Algorithmic Applications (Q3000492):
Displaying 17 items.
- Neighbourhood-width of trees (Q501055) (← links)
- Several notions of rank-width for countable graphs (Q505916) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279) (← links)
- Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- Graphs of small rank-width are pivot-minors of graphs of small tree-width (Q2442212) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications (Q3000492) (← links)
- (Q4625695) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
