Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs (Q2259863): Difference between revisions

@@ Property / OpenAlex ID @@
+W2098118748
@@ Property / OpenAlex ID: W2098118748 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1813
@@ Property / arXiv ID: 1402.1813 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Dirac's map-color theorem for choosability
@@ Property / cites work: Dirac's map-color theorem for choosability / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+On list-coloring extendable outerplanar graphs
@@ Property / cites work: On list-coloring extendable outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph is 5-choosable
@@ Property / cites work: Every planar graph is 5-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Exponentially many 5-list-colorings of planar graphs
+Normal rank
@@ Property / cites work @@
+List colourings of planar graphs
@@ Property / cites work: List colourings of planar graphs / rank @@
+Normal rank