Pages that link to "Item:Q990954"
From MaRDI portal
The following pages link to On the complexity of signed and minus total domination in graphs (Q990954):
Displaying 3 items.
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS (Q3166754) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
