Some sequential graph colouring algorithms (Q3352500): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207218908921070
+Normal rank
@@ Property / OpenAlex ID @@
+W2018458434
@@ Property / OpenAlex ID: W2018458434 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+New methods to color the vertices of a graph
@@ Property / cites work: New methods to color the vertices of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Compactness and balancing in scheduling
@@ Property / cites work: Compactness and balancing in scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770975
@@ Property / cites work: Q4770975 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+How To Color Claw-Free Perfect Graphs
@@ Property / cites work: How To Color Claw-Free Perfect Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5528475
@@ Property / cites work: Q5528475 / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic Scheduling and the Chromatic Number Problem
+Normal rank
@@ Property / cites work @@
+Q5653953
@@ Property / cites work: Q5653953 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank