ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461): Difference between revisions

@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple and fast heuristic algorithm for edge-coloring of graphs
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / 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 @@
+The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
+Normal rank
@@ Property / cites work @@
+Q3007866
@@ Property / cites work: Q3007866 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the maximum 2- and 3-edge-colorable subgraph problems
+Normal rank
@@ Property / cites work @@
+Improved edge-coloring with three colors
@@ Property / cites work: Improved edge-coloring with three colors / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the maximum 3-edge-colorable subgraph problem
+Normal rank
@@ Property / cites work @@
+Q5509541
@@ Property / cites work: Q5509541 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.17654/dm018030317
+Normal rank
@@ Property / OpenAlex ID @@
+W2737753190
@@ Property / OpenAlex ID: W2737753190 / rank @@
+Normal rank