Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/11710
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Forcan J. | en_US |
dc.contributor.author | Mikalački (Rakić), Mirjana | en_US |
dc.date.accessioned | 2020-03-03T14:45:29Z | - |
dc.date.available | 2020-03-03T14:45:29Z | - |
dc.date.issued | 2019-09-02 | - |
dc.identifier.issn | 8629544 | en_US |
dc.identifier.uri | https://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.ispartof | Acta Mathematica Universitatis Comenianae | en |
dc.title | Doubly biased Walker-Breaker games | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.scopus | 2-s2.0-85073377820 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85073377820 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 688 | en |
dc.relation.firstpage | 685 | en |
dc.relation.issue | 3 | en |
dc.relation.volume | 88 | en |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-1268-2972 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.