On the Computation of the Competition Number of a Graph (Q4750663): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1137/0603043
@@ Property / full work available at URL: https://doi.org/10.1137/0603043 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2091556347
@@ Property / OpenAlex ID: W2091556347 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4305523
@@ Property / cites work: Q4305523 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the boxicity of a graph by covering its complement by cointerval graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5515142
@@ Property / cites work: Q5515142 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering edges by cliques with regard to keyword conflicts and intersection graphs
+Normal rank
@@ Property / cites work @@
+Q4152571
@@ Property / cites work: Q4152571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588433
@@ Property / cites work: Q5588433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138414
@@ Property / cites work: Q4138414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4171826
@@ Property / cites work: Q4171826 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of Robert's inequality for boxicity
+Normal rank