Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs (Q2851443): Difference between revisions

@@ Property / cites work @@
+Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633932
@@ Property / cites work: Q4633932 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2004
@@ Property / cites work: Algorithms – ESA 2004 / 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 @@
+Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
+Normal rank
@@ Property / cites work @@
+-list-coloring planar graphs of girth 5
@@ Property / cites work: 3-list-coloring planar graphs of girth 5 / rank @@
+Normal rank
@@ Property / cites work @@
+A short list color proof of Grötzsch's theorem
@@ Property / cites work: A short list color proof of Grötzsch's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Exponentially many 5-list-colorings of planar graphs
+Normal rank
@@ Property / cites work @@
+Many 3-colorings of triangle-free planar graphs
@@ Property / cites work: Many 3-colorings of triangle-free planar graphs / rank @@
+Normal rank