Pages that link to "Item:Q2401761"

The following pages link to Boundary classes for graph problems involving non-local properties (Q2401761):

Displaying 9 items.

• CPG graphs: some structural and hardness results (Q827595) (← links)
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
• Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
• Non-empty intersection of longest paths in \(H\)-free graphs (Q2692169) (← links)
• On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)