Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/1905
DC FieldValueLanguage
dc.contributor.authorMikalački (Rakić), Mirjanaen_US
dc.contributor.authorStojaković, Milaen_US
dc.date.accessioned2019-09-23T10:18:28Z-
dc.date.available2019-09-23T10:18:28Z-
dc.date.issued2018-01-01-
dc.identifier.issn14627264en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/1905-
dc.description.abstract© 2018 by the author(s). 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 the 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.ispartofDiscrete Mathematics and Theoretical Computer Scienceen
dc.titleFast strategies in biased Maker-Breaker gamesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.scopus2-s2.0-85056528848-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85056528848-
dc.description.versionUnknownen_US
dc.relation.issue2en
dc.relation.volume20en
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

1
checked on Feb 22, 2020

Page view(s)

15
Last Week
3
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.