The following pages link to (Q2766682):
Displayed 10 items.
- Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)