Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/15849
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hefetz D. | en_US |
dc.contributor.author | Krivelevich M. | en_US |
dc.contributor.author | Stojaković, Miloš | en_US |
dc.contributor.author | Szabó T. | en_US |
dc.date.accessioned | 2020-03-03T15:01:35Z | - |
dc.date.available | 2020-03-03T15:01:35Z | - |
dc.date.issued | 2008-12-01 | - |
dc.identifier.issn | 08954801 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/15849 | - |
dc.description.abstract | 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. | en |
dc.relation.ispartof | SIAM Journal on Discrete Mathematics | en |
dc.title | Planarity, colorability, and minor games | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1137/060654414 | - |
dc.identifier.scopus | 2-s2.0-56549099411 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/56549099411 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 212 | en |
dc.relation.firstpage | 194 | en |
dc.relation.issue | 1 | en |
dc.relation.volume | 22 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-2545-8849 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
28
checked on May 10, 2024
Page view(s)
16
Last Week
14
14
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.