Pages that link to "Item:Q1680547"

The following pages link to Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547):

Displayed 10 items.

• Computing weighted subset transversals in \(H\)-free graphs (Q832863) ‎ (← links)
• Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) ‎ (← links)
• Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) ‎ (← links)
• Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) ‎ (← links)
• Partitioning \(H\)-free graphs of bounded diameter (Q2166756) ‎ (← links)
• (Q5005166) ‎ (← links)
• Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) ‎ (← 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)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) ‎ (← links)