A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs (Q1159467): Difference between revisions

@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5685113
@@ Property / cites work: Q5685113 / rank @@
+Normal rank
@@ Property / cites work @@
+Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization''
+Normal rank
@@ Property / cites work @@
+Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
+Normal rank
@@ Property / cites work @@
+Normal hypergraphs and the perfect graph conjecture
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(82)90169-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2039582986
@@ Property / OpenAlex ID: W2039582986 / rank @@
+Normal rank