The following pages link to Perfect connected-dominant graphs (Q4458977):
Displaying 12 items.
- The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
- On graphs for which the connected domination number is at most the total domination number (Q423952) (← links)
- The price of connectivity for feedback vertex set (Q516802) (← links)
- Some variations of perfect graphs (Q726645) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← 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)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- On weakly connected domination in graphs. II. (Q2581406) (← links)
- The Price of Connectivity for Cycle Transversals (Q2946410) (← links)
- Connected Domination (Q3384607) (← links)
