Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/3047
DC FieldValueLanguage
dc.contributor.authorMikalački (Rakić), Mirjanaen_US
dc.contributor.authorStojaković, Milaen_US
dc.date.accessioned2019-09-23T10:25:22Z-
dc.date.available2019-09-23T10:25:22Z-
dc.date.issued2017-08-01-
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/3047-
dc.description.abstract© 2017 Elsevier B.V. We study the biased (1 : b) Maker-Breaker positional games, played on the edge set of the complete graph on n vertices, Kn. Given Breaker's bias b, possibly depending on n, we determine the bounds for minimal number of moves, depending on b, in which Maker can win in each of the two standard graph games, the Perfect Matching game and the Hamilton Cycle game.en
dc.relation.ispartofElectronic Notes in Discrete Mathematicsen
dc.titleWinning fast in biased Maker-Breaker gamesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1016/j.endm.2017.07.047-
dc.identifier.scopus2-s2.0-85026724953-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85026724953-
dc.description.versionUnknownen_US
dc.relation.lastpage868en
dc.relation.firstpage863en
dc.relation.volume61en
item.fulltextNo Fulltext-
item.grantfulltextnone-
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

SCOPUSTM   
Citations

2
checked on May 3, 2024

Page view(s)

23
Last Week
10
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


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