Pages that link to "Item:Q1680525"

The following pages link to A width parameter useful for chordal and co-comparability graphs (Q1680525):

Displaying 19 items.

• Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
• Total 2-domination of proper interval graphs (Q2043384) (← links)
• A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
• Mim-width. I. Induced path problems (Q2174563) (← links)
• List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
• Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
• On the thinness and proper thinness of a graph (Q2414456) (← links)
• On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
• (Q2980901) (redirect page) (← links)
• (Q5111880) (← links)
• The perfect matching cut problem revisited (Q5918785) (← links)
• The perfect matching cut problem revisited (Q5925551) (← 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)
• Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
• Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
• Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
• The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)