Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/10697
DC FieldValueLanguage
dc.contributor.authorHefetz D.en_US
dc.contributor.authorMikalački (Rakić), Mirjanaen_US
dc.contributor.authorStojaković M.en_US
dc.date.accessioned2020-03-03T14:40:52Z-
dc.date.available2020-03-03T14:40:52Z-
dc.date.issued2012-03-31-
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/10697-
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.relation.ispartofElectronic Journal of Combinatoricsen
dc.titleDoubly biased maker-breaker connectivity gameen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.scopus2-s2.0-84860128986-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84860128986-
dc.description.versionUnknownen_US
dc.relation.lastpage17en
dc.relation.firstpage1en
dc.relation.volume19en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.orcid0000-0002-1268-2972-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:PMF Publikacije/Publications
Show simple item record

Page view(s)

25
Last Week
8
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.