The following pages link to (Q4858149):
Displaying 20 items.
- Upper bounds on the signed (\(k, k\))-domatic number (Q387615) (← links)
- Complexity of majority monopoly and signed domination problems (Q414422) (← links)
- Bounds on the signed domatic number (Q609986) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- An application of the Turán theorem to domination in graphs (Q948691) (← links)
- Discrepancy and signed domination in graphs and hypergraphs (Q982615) (← links)
- The signed domatic number of some regular graphs (Q1026154) (← links)
- Some remarks on the signed domatic number of graphs with small minimum degree (Q1033055) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- Signed total domination in graphs. (Q1427473) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Minimum monopoly in regular and tree graphs (Q2497525) (← links)
- Signed domatic number of a graph (Q2565862) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- Algorithms and Hardness for Signed Domination (Q2948490) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
- Signed and Minus Dominating Functions in Graphs (Q3384612) (← links)
- The complexity of open k-monopolies in graphs for negative k (Q5106671) (← links)
- (Q5135788) (← links)
- Dominating functions with integer values in graphs—a survey (Q5456310) (← links)
