Pages that link to "Item:Q740279"

The following pages link to Excluded vertex-minors for graphs of linear rank-width at most \(k\) (Q740279):

Displayed 12 items.

• Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) ‎ (← 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)
• Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions (Q1671752) ‎ (← links)
• The complexity of the vertex-minor problem (Q2059901) ‎ (← links)
• Linear rank-width and linear clique-width of trees (Q2346380) ‎ (← links)
• Rank-width: algorithmic and structural results (Q2403788) ‎ (← links)
• An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) ‎ (← links)
• Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) ‎ (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) ‎ (← links)
• Scattered Classes of Graphs (Q4959761) ‎ (← links)
• Graphs of bounded depth‐2 rank‐brittleness (Q6055398) ‎ (← links)