Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957): Difference between revisions

@@ Property / cites work @@
+On acyclic colorings of planar graphs
@@ Property / cites work: On acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
+Normal rank
@@ Property / cites work @@
+Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11
+Normal rank
@@ Property / cites work @@
+Acyclic list 7‐coloring of planar graphs
@@ Property / cites work: Acyclic list 7‐coloring of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Acyclic 5-choosability of planar graphs without 4-cycles
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424787
@@ Property / cites work: Q3424787 / rank @@
+Normal rank
@@ Property / cites work @@
+On the acyclic choosability of graphs
@@ Property / cites work: On the acyclic choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424893
@@ Property / cites work: Q3424893 / 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 @@
+A non-3-choosable planar graph without cycles of length 4 and 5
+Normal rank