Planar graphs of maximum degree seven are Class I (Q1850561): Difference between revisions

@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+On total 9-coloring planar graphs of maximum degree seven
+Normal rank
@@ Property / cites work @@
+On improving the edge-face coloring theorem
@@ Property / cites work: On improving the edge-face coloring theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank