Pages that link to "Item:Q406321"
From MaRDI portal
The following pages link to The price of connectivity for dominating set: upper bounds and complexity (Q406321):
Displayed 10 items.
- A new characterization of \(P_k\)-free graphs (Q300476) (← 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)
- A proof of a conjecture on the connected domination number (Q2091175) (← links)
- The Price of Connectivity for Cycle Transversals (Q2946410) (← links)
- Connected Domination (Q3384607) (← links)
- (Q5005166) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)