Spanning Tree Game as Prim Would Have Played

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


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.
How to Cite
London, A., & Pluhár, A. (2018). Spanning Tree Game as Prim Would Have Played. Acta Cybernetica, 23(3), 921-927.
Regular articles

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.