Pages that link to "Item:Q5009336"

The following pages link to More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336):

Displaying 7 items.

• Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)
• On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
• Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)