Pages that link to "Item:Q4242732"
From MaRDI portal
The following pages link to A semi-induced subgraph characterization of upper domination perfect graphs (Q4242732):
Displaying 10 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)
- \(\alpha \)-domination perfect trees (Q932588) (← links)
- Independence and upper irredundance in claw-free graphs (Q1414584) (← links)
- Upper domination and upper irredundance perfect graphs (Q1584381) (← links)
- A characterization of \(\Gamma\alpha(k)\)-perfect graphs (Q1586777) (← links)
- Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
- Edge weighting functions on semitotal dominating sets (Q2014223) (← links)
- Irredundance (Q3384112) (← links)
- Edge Weighting Functions on Dominating Sets (Q4916094) (← links)