List-edge-colouring planar graphs with precoloured edges (Q1621065): Difference between revisions

@@ Property / cites work @@
+Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
+Normal rank
@@ Property / cites work @@
+List edge and list total colourings of multigraphs
+Normal rank
@@ Property / cites work @@
+Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
+Normal rank
@@ Property / cites work @@
+The complexity of completing partial Latin squares
+Normal rank
@@ Property / cites work @@
+Extension from precoloured sets of edges
@@ Property / cites work: Extension from precoloured sets of edges / 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 @@
+Q4857375
@@ Property / cites work: Q4857375 / rank @@
+Normal rank
@@ Property / cites work @@
+Extending an edge-coloring
@@ Property / cites work: Extending an edge-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+NP‐completeness of list coloring and precoloring extension on the edges of planar graphs
+Normal rank
@@ Property / cites work @@
+Planar graphs of maximum degree seven are Class I
@@ Property / cites work: Planar graphs of maximum degree seven are Class I / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph with maximum degree 7 is of class 1
+Normal rank