The following pages link to (Q4944971):
Displaying 4 items.
- Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game? (Q1024268) (← links)
- On a modular domination game. (Q1426455) (← links)
- On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)