Pages that link to "Item:Q2502893"
From MaRDI portal
The following pages link to Linear layouts measuring neighbourhoods in graphs (Q2502893):
Displaying 13 items.
- Clique-width of path powers (Q266933) (← links)
- Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287) (← links)
- Clique-width with an inactive label (Q465271) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications (Q944739) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- Graphs of Linear Clique-Width at Most 3 (Q3502658) (← links)
- Characterizations of monadic NIP (Q5165493) (← links)
