Pages that link to "Item:Q3166754"
From MaRDI portal
The following pages link to COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS (Q3166754):
Displayed 5 items.
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
- The cyclic rank completion problem with general blocks (Q4965574) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)