Tron, a combinatorial Game on abstract Graphs
From MaRDI portal
Publication:6228367
arXiv1110.3211MaRDI QIDQ6228367FDOQ6228367
Authors: Tillmann Miltzow 
Publication date: 14 October 2011
Abstract: We study the combinatorial two-player game Tron. We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACE- completeness. We proof this conjecture.
This page was built for publication: Tron, a combinatorial Game on abstract Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6228367)
