A linear time algorithm to compute a dominating path in an AT-free graph (Q673002): Difference between revisions

@@ Property / cites work @@
+Connected domination and steiner set on asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+The complexity of regular subgraph recognition
@@ Property / cites work: The complexity of regular subgraph recognition / rank @@
+Normal rank
@@ Property / cites work @@
+Q3797233
@@ Property / cites work: Q3797233 / rank @@
+Normal rank
@@ Property / cites work @@
+Trapezoid graphs and their coloring
@@ Property / cites work: Trapezoid graphs and their coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation Graphs and Transitive Graphs
@@ Property / cites work: Permutation Graphs and Transitive Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Tolerance graphs
@@ Property / cites work: Tolerance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Domination on Cocomparability Graphs
@@ Property / cites work: Domination on Cocomparability Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Representation of a finite graph by a set of intervals on the real line
+Normal rank
@@ Property / cites work @@
+An optimal greedy heuristic to color interval graphs
+Normal rank
@@ Property / cites work @@
+Q3898496
@@ Property / cites work: Q3898496 / rank @@
+Normal rank