On total chromatic number of planar graphs without 4-cycles (Q2372576): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11434-007-2031-x
+Normal rank
@@ Property / OpenAlex ID @@
+W1972304615
@@ Property / OpenAlex ID: W1972304615 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5564127
@@ Property / cites work: Q5564127 / rank @@
+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 @@
+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 planar graphs.
@@ Property / cites work: On the total coloring of planar graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Total colourings of graphs
@@ Property / cites work: Total colourings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On total 9-coloring planar graphs of maximum degree seven
+Normal rank
@@ Property / cites work @@
+The 4-choosability of plane graphs without 4-cycles
+Normal rank