Pages that link to "Item:Q5919305"

The following pages link to Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305):

Displaying 10 items.

• Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
• Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
• Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5915592) (← links)
• On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
• Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
• Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
• Contracting to a longest path in H-free graphs (Q6065420) (← links)
• On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
• Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)