Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214): Difference between revisions

@@ Property / cites work @@
+Q3575455
@@ Property / cites work: Q3575455 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
+Normal rank
@@ Property / cites work @@
+On balanced graphs
@@ Property / cites work: On balanced graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Neighborhood Numbers
@@ Property / cites work: Algorithmic Aspects of Neighborhood Numbers / rank @@
+Normal rank
@@ Property / cites work @@
+On clique-transversals and clique-independent sets
+Normal rank
@@ Property / cites work @@
+Covering the cliques of a graph with vertices
@@ Property / cites work: Covering the cliques of a graph with vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of clique-transversal and clique-independent sets
+Normal rank
@@ Property / cites work @@
+Minimum Edge Dominating Sets
@@ Property / cites work: Minimum Edge Dominating Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Distance-hereditary graphs are clique-perfect
@@ Property / cites work: Distance-hereditary graphs are clique-perfect / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Transversal Sets in Cubic Graphs
@@ Property / cites work: Clique-Transversal Sets in Cubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the clique-transversal number of regular graphs
+Normal rank