Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/10697
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hefetz D. | en_US |
dc.contributor.author | Mikalački (Rakić), Mirjana | en_US |
dc.contributor.author | Stojaković M. | en_US |
dc.date.accessioned | 2020-03-03T14:40:52Z | - |
dc.date.available | 2020-03-03T14:40:52Z | - |
dc.date.issued | 2012-03-31 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/10697 | - |
dc.description.abstract | In this paper we study the (a: b) Maker-Breaker Connectivity game, played on the edge set of the complete graph on n vertices. We determine the winner for almost all values of a and b. | en |
dc.relation.ispartof | Electronic Journal of Combinatorics | en |
dc.title | Doubly biased maker-breaker connectivity game | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.scopus | 2-s2.0-84860128986 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84860128986 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 17 | en |
dc.relation.firstpage | 1 | en |
dc.relation.volume | 19 | 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-1268-2972 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.