Total chromatic number of {square,unichord}-free graphs (Q2883635): Difference between revisions

@@ Property / cites work @@
+Q3070330
@@ Property / cites work: Q3070330 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge and total choosability of near-outerplanar graphs
+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 chromatic number of one kind of join graphs
@@ Property / cites work: Total chromatic number of one kind of join graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total colouring regular bipartite graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+A structure theorem for graphs with no cycle with a unique chord and its consequences
+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 @@
+Determining the total colouring number is NP-hard
@@ Property / cites work: Determining the total colouring number is NP-hard / 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 chromatic number of planar graphs with maximum degree ten
+Normal rank
@@ Property / cites work @@
+The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
+Normal rank
@@ Property / cites work @@
+Total 4-choosability of series-parallel graphs
@@ Property / cites work: Total 4-choosability of series-parallel graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total colourings of graphs
@@ Property / cites work: Total colourings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3815316
@@ Property / cites work: Q3815316 / rank @@
+Normal rank