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 9 items.
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- The algorithmic complexity of minus domination in graphs (Q1917346) (← links)
- Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
- Remarks on the complexity of signed \(k\)-independence on graphs. (Q2828875) (← links)
- Algorithms and Hardness for Signed Domination (Q2948490) (← 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)
- (Q5401063) (← links)
- Kernelization and Lower Bounds of the Signed Domination Problem (Q5405938) (← links)