A simple competitive graph coloring algorithm (Q1569067): Difference between revisions

@@ Property / cites work @@
+Q4028100
@@ Property / cites work: Q4028100 / rank @@
+Normal rank
@@ Property / cites work @@
+A bound for the game chromatic number of graphs
@@ Property / cites work: A bound for the game chromatic number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4201568
@@ Property / cites work: Q4201568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4256107
@@ Property / cites work: Q4256107 / rank @@
+Normal rank
@@ Property / cites work @@
+Radius two trees specify χ‐bounded classes
@@ Property / cites work: Radius two trees specify χ‐bounded classes / rank @@
+Normal rank
@@ Property / cites work @@
+The game coloring number of planar graphs
@@ Property / cites work: The game coloring number of planar graphs / rank @@
+Normal rank