Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101): Difference between revisions

@@ Property / cites work @@
+Equitable coloring and the maximum degree
@@ Property / cites work: Equitable coloring and the maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable \(\Delta\)-coloring of graphs
@@ Property / cites work: Equitable \(\Delta\)-coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence number of random cubic graphs
@@ Property / cites work: On the independence number of random cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
+Normal rank
@@ Property / cites work @@
+Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
+Normal rank
@@ Property / cites work @@
+Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5620621
@@ Property / cites work: Q5620621 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for equitable coloring
@@ Property / cites work: A fast algorithm for equitable coloring / rank @@
+Normal rank