Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/15849
Nаziv: | Planarity, colorability, and minor games | Аutоri: | Hefetz D. Krivelevich M. Stojaković, Miloš Szabó T. |
Dаtum izdаvаnjа: | 1-дец-2008 | Čаsоpis: | SIAM Journal on Discrete Mathematics | Sažetak: | Let m and b be positive integers, and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vertices of F. Maker selects m vertices per move, and Breaker selects 6 vertices per move. The game ends when every vertex has been claimed by one of the players. Maker wins if he claims all of the vertices of some hyperedge of F; otherwise Breaker wins. An (m, b) Avoider-Enforcer game F is played in a similar way. The only difference is in the determination of the winner: Avoider loses if he claims all of the vertices of some hyperedge of F; otherwise Enforcer loses. In this paper we consider the Maker-Breaker and Avoider-Enforcer versions of the planarity game, the k-colorability game, and the Kt-minor game. © 2008 Society for Industrial and Applied Mathematics. | URI: | https://open.uns.ac.rs/handle/123456789/15849 | ISSN: | 08954801 | DOI: | 10.1137/060654414 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
28
prоvеrеnо 10.05.2024.
Prеglеd/i stаnicа
16
Prоtеklа nеdеljа
14
14
Prоtеkli mеsеc
0
0
prоvеrеnо 03.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.