Pages that link to "Item:Q1917346"
From MaRDI portal
The following pages link to The algorithmic complexity of minus domination in graphs (Q1917346):
Displaying 24 items.
- Upper minus domination in a claw-free cubic graph (Q860466) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- An application of the Turán theorem to domination in graphs (Q948691) (← links)
- A note on graphs with large girth and small minus domination number (Q1283810) (← links)
- Minus domination in graphs (Q1297430) (← links)
- Real and integer domination in graphs (Q1297432) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- Lower bounds on the minus domination and \(k\)-subdomination numbers. (Q1401262) (← links)
- Minus domination number in \(k\)-partite graphs. (Q1426125) (← links)
- On complexities of minus domination (Q1751171) (← links)
- Minus domination in regular graphs (Q1910590) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Upper minus total domination in small-degree regular graphs (Q2455571) (← links)
- Total minus domination in \(k\)-partite graphs (Q2502903) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- Minus total domination in graphs (Q3070166) (← links)
- Algorithmic Aspect of Minus Domination on Small-Degree Graphs (Q3196397) (← links)
- On the Minus Domination Number of Graphs (Q3366678) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
- Signed and Minus Dominating Functions in Graphs (Q3384612) (← links)
- The minus total k-domination numbers in graphs (Q5101875) (← links)
- Dominating functions with integer values in graphs—a survey (Q5456310) (← links)
- Minus domination in small-degree graphs (Q5928868) (← links)
- Minus domination number in cubic graph (Q5955866) (← links)