Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. The Probabilistic Method;Alon,2000
2. Elementary bipartite graphs and unique colourability;Bacsó;European Journal of Combinatoric,2002
3. The map-coloring game;Bartnicki;American Mathematical Monthly,2007
4. On the complexity of some coloring games;Bodlaender;International Journal of Foundations of Computer Science,1991
5. The game chromatic number of random graphs;Bohman;Random Structures & Algorithms,2008
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Indicated domination game;Discrete Mathematics;2024-09
2. Indicated coloring of some families of graphs;Discrete Mathematics, Algorithms and Applications;2024-06-06
3. On monotonicity in Maker–Breaker graph colouring games;Discrete Applied Mathematics;2024-04
4. On Game Chromatic Vertex-Critical Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2022-11-25
5. Indicated coloring of the Mycielskian of some families of graphs;Discrete Mathematics, Algorithms and Applications;2022-03-12