Pages that link to "Item:Q3181057"

The following pages link to On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057):

Displaying 8 items.

• Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
• Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
• More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336) (← links)
• (Q5075752) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)
• Improved (In-)Approximability Bounds for d-Scattered Set (Q6107026) (← links)
• On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)