Approximating maximum edge 2-coloring in simple graphs (Q608271): Difference between revisions

@@ Property / cites work @@
+Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects in information and management. Third international conference, AAIM 2007, Portland, OR, USA, June 6--8, 2007. Proceedings.
+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 @@
+Approximating the maximum 2- and 3-edge-colorable subgraph problems
+Normal rank
@@ Property / cites work @@
+Packing \([1, \Delta ]\)-factors in graphs of small degree
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank