Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-68880-8_10
+Normal rank
@@ Property / OpenAlex ID @@
+W2787282131
@@ Property / OpenAlex ID: W2787282131 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for maximum edge 2-coloring in simple graphs
+Normal rank
@@ Property / cites work @@
+Q4411281
@@ Property / cites work: Q4411281 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Recognizing Equal Unions in Families of Sets
+Normal rank
@@ Property / cites work @@
+Path factors in cubic graphs
@@ Property / cites work: Path factors in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank