Pages that link to "Item:Q2413964"

The following pages link to Lower bounds on the mim-width of some graph classes (Q2413964):

Displaying 9 items.

• A width parameter useful for chordal and co-comparability graphs (Q1680525) (← links)
• Well-partitioned chordal graphs (Q2144581) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
• Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
• Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)