Pages that link to "Item:Q415287"
From MaRDI portal
The following pages link to Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs (Q415287):
Displayed 16 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)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- Between clique-width and linear clique-width of bipartite graphs (Q2185929) (← 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)
- Colouring diamond-free graphs (Q2402373) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- (Q4625695) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- (Q5856407) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5890917) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)