Construction of acyclically 4-colourable planar triangulations with minimum degree 4 (Q5031739): Difference between revisions

@@ Property / cites work @@
+Every planar graph has an acyclic 7-coloring
@@ Property / cites work: Every planar graph has an acyclic 7-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On generating planar graphs
@@ Property / cites work: On generating planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3313877
@@ Property / cites work: Q3313877 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972101
@@ Property / cites work: Q3972101 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4137202
@@ Property / cites work: Q4137202 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
+Normal rank
@@ Property / cites work @@
+Flips in planar graphs
@@ Property / cites work: Flips in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A History of Flips in Combinatorial Triangulations
+Normal rank
@@ Property / cites work @@
+Generation of Triangulations of the Sphere
@@ Property / cites work: Generation of Triangulations of the Sphere / rank @@
+Normal rank
@@ Property / cites work @@
+Construction of planar triangulations with minimum degree 5
+Normal rank
@@ Property / cites work @@
+Q3548359
@@ Property / cites work: Q3548359 / rank @@
+Normal rank
@@ Property / cites work @@
+A Generation Procedure for the Simple 3-Polytopes With Cyclically 5-Connected Graphs
+Normal rank
@@ Property / cites work @@
+A sufficient condition for planar graphs to be acyclically 5-choosable
+Normal rank
@@ Property / cites work @@
+Planar graphs without 4- and 5-cycles are acyclically 4-choosable
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of planar graphs
@@ Property / cites work: Acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Every toroidal graph is acyclically 8-choosable
@@ Property / cites work: Every toroidal graph is acyclically 8-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic coloring of graphs without bichromatic long path
+Normal rank
@@ Property / cites work @@
+Q4200238
@@ Property / cites work: Q4200238 / rank @@
+Normal rank
@@ Property / cites work @@
+Note to the paper of Grünbaum on acyclic colorings
+Normal rank
@@ Property / cites work @@
+Every planar graph has an acyclic 8-coloring
@@ Property / cites work: Every planar graph has an acyclic 8-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q5528475
@@ Property / cites work: Q5528475 / rank @@
+Normal rank
@@ Property / cites work @@
+Bemerkungen zum Vierfarbenproblem
@@ Property / cites work: Bemerkungen zum Vierfarbenproblem / rank @@
+Normal rank