Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. On the complexity of some coloring games;Bodlaender;Internat. J. Found. Comput. Sci.,1991
2. Domination game and an imagination strategy;Brešar;SIAM J. Discrete Math.,2010
3. Graph Theory;Diestel,2010
4. Connectivity algorithms;Esfahanian;Encyclopedia Math. Appl.,2013
5. An algorithm for determining whether the connectivity of a graph is at least k;Even;SIAM J. Comput.,1975
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Note on fair game edge-connectivity of graphs;Discrete Applied Mathematics;2023-07
2. Game edge-connectivity of graphs;Discrete Applied Mathematics;2021-07