On coloring box graphs (Q472968): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2014.09.004
@@ Property / DOI: 10.1016/j.disc.2014.09.004 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2014.09.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2015223293
@@ Property / OpenAlex ID: W2015223293 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.1016/J.DISC.2014.09.004
@@ Property / DOI: 10.1016/J.DISC.2014.09.004 / rank @@
+Normal rank