Pages that link to "Item:Q1941700"
From MaRDI portal
The following pages link to The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700):
Displaying 7 items.
- On a class of graphs between threshold and total domishold graphs (Q496435) (← links)
- On dominating sets whose induced subgraphs have a bounded diameter (Q2444556) (← links)
- Connected Domination (Q3384607) (← links)
- Acyclic total dominating sets in cubic graphs (Q5028796) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
- A unified greedy approximation for several dominating set problems (Q6093579) (← links)
