Minus domination number in \(k\)-partite graphs. (Q1426125): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2003.07.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1974622345
@@ Property / OpenAlex ID: W1974622345 / rank @@
+Normal rank
@@ Property / cites work @@
+The algorithmic complexity of minus domination in graphs
+Normal rank
@@ Property / cites work @@
+Minus domination in graphs
@@ Property / cites work: Minus domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4374702
@@ Property / cites work: Q4374702 / rank @@
+Normal rank
@@ Property / cites work @@
+Strict majority functions on graphs
@@ Property / cites work: Strict majority functions on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Inequalities relating domination parameters in cubic graphs
+Normal rank
@@ Property / cites work @@
+Q4552219
@@ Property / cites work: Q4552219 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the minus domination and \(k\)-subdomination numbers.
+Normal rank