Молимо вас користите овај идентификатор за цитирање или овај линк до ове ставке:
https://open.uns.ac.rs/handle/123456789/15849
Назив: | Planarity, colorability, and minor games | Аутори: | Hefetz D. Krivelevich M. Stojaković, Miloš Szabó T. |
Датум издавања: | 1-дец-2008 | Часопис: | SIAM Journal on Discrete Mathematics | Сажетак: | 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 |
Налази се у колекцијама: | PMF Publikacije/Publications |
Приказати целокупан запис ставки
SCOPUSTM
Навођења
28
проверено 10.05.2024.
Преглед/и станица
16
Протекла недеља
14
14
Протекли месец
0
0
проверено 03.05.2024.
Google ScholarTM
Проверите
Алт метрика
Ставке на DSpace-у су заштићене ауторским правима, са свим правима задржаним, осим ако није другачије назначено.