Pages that link to "Item:Q4435348"
From MaRDI portal
The following pages link to Deciding Clique-Width for Graphs of Bounded Tree-Width (Q4435348):
Displayed 6 items.
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- On the relationship between NLC-width and linear NLC-width (Q2576869) (← links)