Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/26878
DC FieldValueLanguage
dc.contributor.authorHefetz Dan-
dc.contributor.authorMikalački Mirjana-
dc.contributor.authorStojaković Miloš-
dc.date.accessioned2020-12-13T21:15:11Z-
dc.date.available2020-12-13T21:15:11Z-
dc.date.issued2012-
dc.identifier.issn1077-8926-
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/26878-
dc.description.abstractIn 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.isoen-
dc.relation.ispartofElectronic Journal of Combinatoricsen
dc.sourceCRIS UNS-
dc.source.urihttp://cris.uns.ac.rs-
dc.subjectMaker-Breaker games, biased games, connectivityen
dc.titleDoubly biased Maker-Breaker Connectivity gameen
dc.typeJournal/Magazine Articleen
dc.identifier.urlhttps://www.cris.uns.ac.rs/record.jsf?recordId=67932&source=BEOPEN&language=enen
dc.relation.issueIssue 1-
dc.relation.volume19-
dc.identifier.externalcrisreference(BISIS)67932-
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.orcid0000-0002-2545-8849-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:PMF Publikacije/Publications
Show simple item record

Page view(s)

20
Last Week
2
Last month
0
checked on May 10, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.