Graph colorings with restricted bicolored subgraphs: II. The graph coloring game (Q6081568): Difference between revisions

@@ Property / cites work @@
+Game chromatic number of Cartesian product graphs
@@ Property / cites work: Game chromatic number of Cartesian product graphs / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE COMPLEXITY OF SOME COLORING GAMES
@@ Property / cites work: ON THE COMPLEXITY OF SOME COLORING GAMES / rank @@
+Normal rank
@@ Property / cites work @@
+On acyclic colorings of planar graphs
@@ Property / cites work: On acyclic colorings of planar graphs / 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 @@
+Q2822601
@@ Property / cites work: Q2822601 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
+Normal rank
@@ Property / cites work @@
+The game coloring number of pseudo partial \(k\)-trees
+Normal rank
@@ Property / cites work @@
+Game coloring the Cartesian product of graphs
@@ Property / cites work: Game coloring the Cartesian product of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Refined activation strategy for the marking game
@@ Property / cites work: Refined activation strategy for the marking game / rank @@
+Normal rank