Entire coloring of 2-connected plane graphs (Q2662784): 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 @@
+A new proof of the 6 color theorem
@@ Property / cites work: A new proof of the 6 color theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Structural theorem on plane graphs with application to the entire coloring number
+Normal rank
@@ Property / cites work @@
+A seven-color theorem on the sphere
@@ Property / cites work: A seven-color theorem on the sphere / rank @@
+Normal rank
@@ Property / cites work @@
+Ein Sechsfarbenproblem auf der Kugel
@@ Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank @@
+Normal rank
@@ Property / cites work @@
+On the Entire Coloring Conjecture
@@ Property / cites work: On the Entire Coloring Conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds of entire chromatic number of plane graphs
+Normal rank
@@ Property / cites work @@
+Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable
+Normal rank
@@ Property / cites work @@
+Plane Graphs with Maximum Degree  Are Entirely ‐Colorable
+Normal rank
@@ Property / cites work @@
+Entire colouring of plane graphs
@@ Property / cites work: Entire colouring of plane graphs / rank @@
+Normal rank