Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Total colorings of planar graphs with large maximum degree
+Normal rank
@@ Property / cites work @@
+Total colourings of planar graphs with large girth
+Normal rank
@@ Property / cites work @@
+List edge and list total colorings of planar graphs without 4-cycles
+Normal rank
@@ Property / cites work @@
+Total colorings of planar graphs without small cycles
+Normal rank
@@ Property / cites work @@
+Total-Coloring of Plane Graphs with Maximum Degree Nine
+Normal rank
@@ Property / cites work @@
+On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
+Normal rank
@@ Property / cites work @@
+Total colorings of planar graphs without adjacent triangles
+Normal rank
@@ Property / cites work @@
+Q5564127
@@ Property / cites work: Q5564127 / rank @@
+Normal rank
@@ Property / cites work @@
+Total chromatic number of planar graphs with maximum degree ten
+Normal rank
@@ Property / cites work @@
+On total chromatic number of planar graphs without 4-cycles
+Normal rank