Pages that link to "Item:Q819817"
From MaRDI portal
The following pages link to Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817):
Displaying 12 items.
- \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs (Q389453) (← 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)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Characterizations for restricted graphs of NLC-width 2 (Q870845) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Graphs of Linear Clique-Width at Most 3 (Q3502658) (← links)
