Efficient and perfect domination on circular-arc graphs (Q324824): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2015.07.051
@@ Property / DOI: 10.1016/j.endm.2015.07.051 / rank @@
-Normal rank
@@ Property / cites work @@
+Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
+Normal rank
@@ Property / cites work @@
+Algorithms for clique-independent sets on subclasses of circular-arc graphs
+Normal rank
@@ Property / cites work @@
+On cliques of Helly Circular-arc Graphs
@@ Property / cites work: On cliques of Helly Circular-arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and perfect domination on circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Fast algorithms for some dominating induced matching problems
+Normal rank
@@ Property / cites work @@
+Perfect edge domination and efficient edge domination in graphs
+Normal rank
@@ Property / cites work @@
+Linear-time recognition of circular-arc graphs
@@ Property / cites work: Linear-time recognition of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.ENDM.2015.07.051
@@ Property / DOI: 10.1016/J.ENDM.2015.07.051 / rank @@
+Normal rank