Spanning tree game as prim would have played

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

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

Download (333kB) | Preview


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
ISSN: 0324-721X
Page Range: pp. 921-928
Language: English
Place of Publication: Szeged
Related URLs:
Uncontrolled Keywords: Számítógépes játékok, Gráf
Additional Information: Bibliogr.: p. 926-927. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2018. Nov. 08. 09:01
Last Modified: 2022. Jun. 21. 08:28

Actions (login required)

View Item View Item