Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/11710
DC FieldValueLanguage
dc.contributor.authorForcan J.en_US
dc.contributor.authorMikalački (Rakić), Mirjanaen_US
dc.date.accessioned2020-03-03T14:45:29Z-
dc.date.available2020-03-03T14:45:29Z-
dc.date.issued2019-09-02-
dc.identifier.issn8629544en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/11710-
dc.description.abstract© 2019, Univerzita Komenskeho. All rights reserved. We study doubly biased Walker-Breaker games, played on the edge set of a complete graph on n vertices, Kn. Walker-Breaker game is a variant of Maker- Breaker game, where Walker, playing the role of Maker, must choose her edges according to a walk, while Breaker has no restrictions on choosing his edges. Here we show that for b ≤ (image found), playing a (2: B) game on E(Kn), Walker can create a graph containing a spanning tree. Also, we determine a constant c > 0 such that Walker has a strategy to make a Hamilton cycle of Kn in the (2: Cn/ln n) game.en
dc.relation.ispartofActa Mathematica Universitatis Comenianaeen
dc.titleDoubly biased Walker-Breaker gamesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.scopus2-s2.0-85073377820-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85073377820-
dc.description.versionUnknownen_US
dc.relation.lastpage688en
dc.relation.firstpage685en
dc.relation.issue3en
dc.relation.volume88en
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

Page view(s)

22
Last Week
11
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.