Pages that link to "Item:Q516908"
From MaRDI portal
The following pages link to A note on an induced subgraph characterization of domination perfect graphs (Q516908):
Displaying 8 items.
- Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs (Q1733857) (← links)
- Models and algorithms for the product pricing with single-minded customers requesting bundles (Q2027005) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Perfect graphs for domination games (Q2660136) (← links)
- (Q5005166) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
- Common domination perfect graphs (Q6184333) (← links)
