Pages that link to "Item:Q2864286"
From MaRDI portal
The following pages link to Linear Rank-Width and Linear Clique-Width of Trees (Q2864286):
Displaying 11 items.
- Clique-width with an inactive label (Q465271) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- Several notions of rank-width for countable graphs (Q505916) (← links)
- Tree-width, clique-minors, and eigenvalues. (Q1421528) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← 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)
- Vertex-minors of graphs: a survey (Q6495258) (← links)