Acyclic domination on bipartite permutation graphs (Q845701): Difference between revisions

@@ Property / author @@
+Li-ying Kang
@@ Property / author: Li-ying Kang / 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.ipl.2006.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1990345395
@@ Property / OpenAlex ID: W1990345395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic domination
@@ Property / cites work: Acyclic domination / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the weighted efficient edge domination problem on bipartite permutation graphs
+Normal rank
@@ Property / cites work @@
+Weighted efficient domination problem on some perfect graphs
+Normal rank
@@ Property / cites work @@
+Bipartite permutation graphs
@@ Property / cites work: Bipartite permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge domination on bipartite permutation graphs and cotriangulated graphs
+Normal rank