Roman domination in subgraphs of grids (Q324726): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2015.07.014
@@ Property / DOI: 10.1016/j.endm.2015.07.014 / 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.endm.2015.07.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2220850808
@@ Property / OpenAlex ID: W2220850808 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Roman domination in graphs.
@@ Property / cites work: Roman domination in graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for Roman domination on some classes of graphs
+Normal rank
@@ Property / cites work @@
+Inclusion/exclusion meets measure and conquer
@@ Property / cites work: Inclusion/exclusion meets measure and conquer / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2015.07.014
@@ Property / DOI: 10.1016/J.ENDM.2015.07.014 / rank @@
+Normal rank