Pages that link to "Item:Q974753"

The following pages link to Connected vertex covers in dense graphs (Q974753):

Displaying 16 items.

• The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
• The price of connectivity for feedback vertex set (Q516802) (← links)
• The price of connectivity for cycle transversals (Q739064) (← links)
• Approximating edge dominating set in dense graphs (Q764308) (← links)
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
• Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
• Approximation algorithm for minimum connected 3-path vertex cover (Q2004079) (← links)
• Extension and its price for the connected vertex cover problem (Q2072064) (← links)
• The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
• Approximating Subdense Instances of Covering Problems (Q2840726) (← links)
• The Price of Connectivity for Cycle Transversals (Q2946410) (← links)
• (Q5005166) (← 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)
• Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
• On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)