Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/26878
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hefetz Dan | - |
dc.contributor.author | Mikalački Mirjana | - |
dc.contributor.author | Stojaković Miloš | - |
dc.date.accessioned | 2020-12-13T21:15:11Z | - |
dc.date.available | 2020-12-13T21:15:11Z | - |
dc.date.issued | 2012 | - |
dc.identifier.issn | 1077-8926 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/26878 | - |
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.language.iso | en | - |
dc.relation.ispartof | Electronic Journal of Combinatorics | en |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.subject | Maker-Breaker games, biased games, connectivity | en |
dc.title | Doubly biased Maker-Breaker Connectivity game | en |
dc.type | Journal/Magazine Article | en |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=67932&source=BEOPEN&language=en | en |
dc.relation.issue | Issue 1 | - |
dc.relation.volume | 19 | - |
dc.identifier.externalcrisreference | (BISIS)67932 | - |
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 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.