Pages that link to "Item:Q2403788"

The following pages link to Rank-width: algorithmic and structural results (Q2403788):

Displaying 23 items.

• The complexity of the vertex-minor problem (Q2059901) (← links)
• The grid theorem for vertex-minors (Q2099410) (← links)
• Rank connectivity and pivot-minors of graphs (Q2107500) (← links)
• Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
• Subgraph complementation (Q2182091) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• Comparing linear width parameters for directed graphs (Q2322714) (← links)
• Digraphs of Bounded Width (Q3120441) (← links)
• Recent Progress on Well-Quasi-ordering Graphs (Q3295151) (← links)
• A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
• Scattered Classes of Graphs (Q4959761) (← links)
• (Q5009491) (← links)
• Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
• Partial complementation of graphs (Q5116485) (← links)
• Intertwining Connectivities for Vertex-Minors and Pivot-Minors (Q5883288) (← links)
• On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
• Graphs of bounded depth‐2 rank‐brittleness (Q6055398) (← links)
• Tangle bases: Revisited (Q6087071) (← links)
• Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
• Vertex-minors of graphs: a survey (Q6495258) (← links)
• Fast FPT-approximation of branchwidth (Q6593764) (← links)
• Tree pivot-minors and linear rank-width (Q6621185) (← links)
• Treewidth, circle graphs and circular drawings (Q6630449) (← links)