Pages that link to "Item:Q2346380"

The following pages link to Linear rank-width and linear clique-width of trees (Q2346380):

Displaying 15 items.

• 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)
• Tree-width, clique-minors, and eigenvalues. (Q1421528) (← links)
• Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) (← links)
• Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
• Rank-width: algorithmic and structural results (Q2403788) (← links)
• Obstructions for linear rank-width at most 1 (Q2442201) (← links)
• Excluded vertex-minors for graphs of linear rank-width at most k. (Q2957886) (← links)
• A Complete Characterisation of the Linear Clique-Width of Path Powers (Q3630209) (← links)
• A Linear Algorithm for Topological Bandwidth in Degree-Three Trees (Q3813314) (← links)
• Approximating rank-width and clique-width quickly (Q4962768) (← links)
• Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
• (Q5856407) (← links)
• Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
• Tree pivot-minors and linear rank-width (Q6621185) (← links)