Pages that link to "Item:Q6056798"

The following pages link to Bounding the mim‐width of hereditary graph classes (Q6056798):

Displaying 13 items.

• A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
• Mim-width. I. Induced path problems (Q2174563) (← links)
• Mim-width. II. The feedback vertex set problem (Q2285053) (← links)
• Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
• Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width (Q3304141) (← 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)