Pages that link to "Item:Q5413911"
From MaRDI portal
The following pages link to The Price of Connectivity for Vertex Cover (Q5413911):
Displayed 12 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)
- 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)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Connected power domination in graphs (Q2424811) (← 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)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)