On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5564127
@@ Property / cites work: Q5564127 / rank @@
+Normal rank
@@ Property / cites work @@
+The total coloring of a multigraph with maximal degree 4
+Normal rank
@@ Property / cites work @@
+The total chromatic number of any multigraph with maximum degree five is at most seven
+Normal rank
@@ Property / cites work @@
+On the total coloring of certain graphs
@@ Property / cites work: On the total coloring of certain graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Total Chromatic Number of a Graph
@@ Property / cites work: On Total Chromatic Number of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Total colourings of graphs
@@ Property / cites work: Total colourings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the total coloring of planar graphs.
@@ Property / cites work: On the total coloring of planar graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+On total 9-coloring planar graphs of maximum degree seven
+Normal rank
@@ Property / cites work @@
+On total chromatic number of planar graphs without 4-cycles
+Normal rank
@@ Property / cites work @@
+Total colorings of planar graphs with large maximum degree
+Normal rank
@@ Property / cites work @@
+Total-Coloring of Plane Graphs with Maximum Degree Nine
+Normal rank
@@ Property / cites work @@
+Total chromatic number of planar graphs with maximum degree ten
+Normal rank