Spanning Tree Game as Prim Would Have Played

  • András London
  • András Pluhár

Abstract

In this paper, we investigate special types of Maker-Breaker games defined on graphs. We restrict Maker’s possible moves that resembles the way that was introduced by Espig, Frieze, Krivelevich and Pedgen [9]. Here, we require that the subgraph induced by Maker’s edges must be connected throughout the game. Besides the normal play, we examine the biased and accelerated versions of these games.
Published
2018-01-01
How to Cite
London, A., & Pluhár, A. (2018). Spanning Tree Game as Prim Would Have Played. Acta Cybernetica, 23(3), 921-927. https://doi.org/10.14232/actacyb.23.3.2018.12
Section
Regular articles