On coloring box graphs (Q472968): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable
@@ Property / cites work: Every planar map is four colorable / rank @@
+Normal rank
@@ Property / cites work @@
+Higher-Dimensional Analogues of the Map Coloring Problem
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+On almost \((k-1)\)-degenerate \((k+1)\)-chromatic graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Rhombic Penrose Tilings Can be 3-Colored
@@ Property / cites work: Rhombic Penrose Tilings Can be 3-Colored / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449983
@@ Property / cites work: Q4449983 / rank @@
+Normal rank