Pages that link to "Item:Q516802"
From MaRDI portal
The following pages link to The price of connectivity for feedback vertex set (Q516802):
Displayed 5 items.
- 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)
- Non-empty intersection of longest paths in \(H\)-free graphs (Q2692169) (← links)
- (Q5005166) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)