Pages that link to "Item:Q6056798"
From MaRDI portal
The following pages link to Bounding the mim‐width of hereditary graph classes (Q6056798):
Displaying 7 items.
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
