Bounds on the connected \(k\)-domination number in graphs (Q608255): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2010.05.021
@@ Property / DOI: 10.1016/j.dam.2010.05.021 / rank @@
-Normal rank
@@ 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.dam.2010.05.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2050150370
@@ Property / OpenAlex ID: W2050150370 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating a Family of Graphs with Small Connected Subgraphs
+Normal rank
@@ Property / cites work @@
+On Hadwiger's Number and the Stability Number
@@ Property / cites work: On Hadwiger's Number and the Stability Number / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691778
@@ Property / cites work: Q3691778 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691779
@@ Property / cites work: Q3691779 / rank @@
+Normal rank
@@ Property / cites work @@
+A general method in the theory of domination in graphs
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3561427
@@ Property / cites work: Q3561427 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2010.05.021
@@ Property / DOI: 10.1016/J.DAM.2010.05.021 / rank @@
+Normal rank