Approximating the maximum 3-edge-colorable subgraph problem (Q1043590): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2008.11.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2033199347
@@ Property / OpenAlex ID: W2033199347 / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
+Normal rank
@@ Property / cites work @@
+A matching problem with side conditions
@@ Property / cites work: A matching problem with side conditions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411281
@@ Property / cites work: Q4411281 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+NP completeness of finding the chromatic index of regular graphs
+Normal rank
@@ Property / cites work @@
+A constructive proof of Vizing's theorem
@@ Property / cites work: A constructive proof of Vizing's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921756
@@ Property / cites work: Q2921756 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank