Complexity of approximation of 3-edge-coloring of graphs (Q975462): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2008.05.015
@@ Property / DOI: 10.1016/j.ipl.2008.05.015 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2008.05.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2004299695
@@ Property / OpenAlex ID: W2004299695 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
+Normal rank
@@ Property / cites work @@
+A cyclically 6-edge-connected snark of order 118
@@ Property / cites work: A cyclically 6-edge-connected snark of order 118 / rank @@
+Normal rank
@@ Property / cites work @@
+Superposition and constructions of graphs without nowhere-zero \(k\)-flows
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2008.05.015
@@ Property / DOI: 10.1016/J.IPL.2008.05.015 / rank @@
+Normal rank