Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613): Difference between revisions

@@ Property / cites work @@
+List-colourings of graphs
@@ Property / cites work: List-colourings of graphs / rank @@
+Normal rank
@@ 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 @@
+A Generalization of Kotzig’s Theorem and Its Application
+Normal rank
@@ Property / cites work @@
+The list chromatic index of a bipartite multigraph
+Normal rank
@@ Property / cites work @@
+New Bounds on the List-Chromatic Index of the  Complete Graph and Other Simple Graphs
+Normal rank
@@ Property / cites work @@
+Graphs of degree 4 are 5-edge-choosable
@@ Property / cites work: Graphs of degree 4 are 5-edge-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
+Normal rank
@@ Property / cites work @@
+Near-optimal list colorings
@@ Property / cites work: Near-optimal list colorings / rank @@
+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 @@
+Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank