{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:26:38Z","timestamp":1777645598186,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T00:00:00Z","timestamp":1647561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2022,3,18]]},"abstract":"<jats:p>\n                    We study the biased (2 : b) Walker\u2013Breaker games, played on the edge set of the complete graph on n vertices, K\n                    <jats:sub>n<\/jats:sub>\n                    . These games are a variant of the Maker\u2013Breaker games with the restriction that Walker (playing the role of Maker) has to choose her edges according to a walk. We look at the two standard graph games \u2013 the Connectivity game and the Hamilton Cycle game and show that Walker can win both games even when playing against Breaker whose bias is of the order of magnitude n\/ ln n.\n                  <\/jats:p>","DOI":"10.3233\/fi-222104","type":"journal-article","created":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T12:12:53Z","timestamp":1647605573000},"page":"83-97","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Spanning Structures in Walker\u2013Breaker Games"],"prefix":"10.1177","volume":"185","author":[{"given":"Jovana","family":"Forcan","sequence":"first","affiliation":[{"name":"Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Trg Dositeja Obradovi\u0107a 4, 21000 Novi Sad, Serbia. ,"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirjana","family":"Mikala\u010dki","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Informatics, Faculty of Sciences, University of Novi Sad, Trg Dositeja Obradovi\u0107a 4, 21000 Novi Sad, Serbia. ,"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2022,3,18]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-222104","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-222104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:41Z","timestamp":1777444361000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-222104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,18]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3,18]]}},"alternative-id":["10.3233\/FI-222104"],"URL":"https:\/\/doi.org\/10.3233\/fi-222104","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,18]]}}}