Pages that link to "Item:Q719287"
From MaRDI portal
The following pages link to Graphs of linear clique-width at most 3 (Q719287):
Displaying 20 items.
- Clique-width of path powers (Q266933) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← 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)
- Vertex-transitive CIS graphs (Q472401) (← links)
- Neighbourhood-width of trees (Q501055) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Clique-width of full bubble model graphs (Q2341723) (← links)
- Linear rank-width and linear clique-width of trees (Q2346380) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Clique-width and edge contraction (Q2350597) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Linear Clique‐Width for Hereditary Classes of Cographs (Q2978187) (← links)
- Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (Q4982284) (← links)
- (Q5856407) (← links)