Spanning tree game as prim would have played

London, András and Pluhár, András: Spanning tree game as prim would have played. Acta cybernetica, (23) 3. pp. 921-928. (2018)

[img] Cikk, tanulmány, mű
actacyb_23_3_2018_12.pdf

Download (333kB)

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2018
Volume: 23
Number: 3
Page Range: pp. 921-928
ISSN: 0324-721X
Uncontrolled Keywords: Számítógépes játékok, Gráf
Additional Information: Bibliogr.: p. 926-927. ; Összefoglalás angol nyelven
Date Deposited: 2018. Nov. 08. 09:01
Last Modified: 2018. Nov. 08. 09:01
URI: http://acta.bibl.u-szeged.hu/id/eprint/55685

Actions (login required)

View Item View Item