On the total choosability of planar graphs and of sparse graphs (Q407575): Difference between revisions

@@ Property / cites work @@
+Total colorings of planar graphs with large maximum degree
+Normal rank
@@ Property / cites work @@
+List edge and list total colourings of multigraphs
+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 @@
+List Total Colourings of Graphs
@@ Property / cites work: List Total Colourings of Graphs / 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 @@
+Total colorings and list total colorings of planar graphs without intersecting 4-cycles
+Normal rank
@@ Property / cites work @@
+(d,1)-total labeling of graphs with a given maximum average degree
+Normal rank
@@ Property / cites work @@
+On total 9-coloring planar graphs of maximum degree seven
+Normal rank
@@ Property / cites work @@
+SOME UNSOLVED PROBLEMS IN GRAPH THEORY
@@ Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Total chromatic number of planar graphs with maximum degree ten
+Normal rank
@@ Property / cites work @@
+Total colourings of graphs
@@ Property / cites work: Total colourings of graphs / rank @@
+Normal rank