Pages that link to "Item:Q2348055"
From MaRDI portal
The following pages link to A characterisation of clique-width through nested partitions (Q2348055):
Displaying 8 items.
- Clique-width of path powers (Q266933) (← links)
- The behavior of clique-width under graph operations and graph transformations (Q519907) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Grammars and clique-width bounds from split decompositions (Q2174558) (← links)
- Clique-width of full bubble model graphs (Q2341723) (← links)
- From tree-decompositions to clique-width terms (Q2413974) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
