The total chromatic number of split-indifference graphs (Q442393): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2012.01.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2002368069
@@ Property / OpenAlex ID: W2002368069 / rank @@
+Normal rank
@@ Property / cites work @@
+The Colour Numbers of Complete Graphs
@@ Property / cites work: The Colour Numbers of Complete Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge and total coloring of interval graphs
@@ Property / cites work: Edge and total coloring of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4697576
@@ Property / cites work: Q4697576 / rank @@
+Normal rank
@@ Property / cites work @@
+On edge-colouring indifference graphs
@@ Property / cites work: On edge-colouring indifference graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total-chromatic number and chromatic index of dually chordal graphs
+Normal rank
@@ Property / cites work @@
+A total-chromatic number analogue of Plantholt's theorem
+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 colouring regular bipartite graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+Characterizing and edge-colouring split-indifference graphs
+Normal rank
@@ Property / cites work @@
+On the compatibility between a graph and a simple order
+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