Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768): Difference between revisions

@@ Property / cites work @@
+Every Planar Map is Four Colorable
@@ Property / cites work: Every Planar Map is Four Colorable / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of Graph Theory
@@ Property / cites work: Handbook of Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5587076
@@ Property / cites work: Q5587076 / 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 @@
+-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
+Normal rank
@@ Property / cites work @@
+Polyhedral embeddings of snarks in orientable surfaces
+Normal rank
@@ Property / cites work @@
+Superposition and constructions of graphs without nowhere-zero \(k\)-flows
+Normal rank
@@ Property / cites work @@
+Edge-coloring of multigraphs
@@ Property / cites work: Edge-coloring of multigraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of approximation of 3-edge-coloring of graphs
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank