Pages that link to "Item:Q1962038"
From MaRDI portal
The following pages link to Domination and total domination on asteroidal triple-free graphs (Q1962038):
Displaying 8 items.
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- On conditional covering problem (Q626967) (← links)
- Matching properties in total domination vertex critical graphs (Q968225) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Independent sets in asteroidal triple-free graphs (Q4572004) (← links)
