Pages that link to "Item:Q527431"

The following pages link to Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431):

Displaying 13 items.

• 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)
• A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← 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)
• Linear Rank-Width of Distance-Hereditary Graphs (Q2945179) (← links)
• (Q4863482) (← links)
• Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
• A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
• Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
• Twin-distance-hereditary digraphs (Q6132965) (← links)
• Tree pivot-minors and linear rank-width (Q6621185) (← links)