The following pages link to (Q3139841):
Displaying 16 items.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- \([1,2]\)-domination in graphs (Q401141) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- Combinatorial properties of a general domination problem with parity constraints (Q998375) (← links)
- A solitaire game played on 2-colored graphs (Q998506) (← links)
- Parity dimension for graphs (Q1584295) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- On the complexity of dominating set problems related to the minimum all-ones problem (Q2456358) (← links)
- Odd neighborhood transversals on grid graphs (Q2643313) (← links)
- Odd and residue domination numbers of a graph (Q2773048) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- (Q4582712) (← links)
- Lights Out On A Random Graph (Q5045960) (← links)
- Connected odd dominating sets in graphs (Q5492638) (← links)
