Spanning tree game as prim would have played

DOI10.14232/ACTACYB.23.3.2018.12MaRDI QIDQ4584660zbMATH OpenOpenAlexWikidataFDO

Authors András London, András Pluhár

Publication date 3 September 2018

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.23.3.2018.12

zbMATH Keywords

biased gamespositional gamesspanning tree

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) 2-person games (91A05) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Recommendations

• Building spanning trees quickly in maker-breaker games
• Building spanning trees quickly in maker-breaker games
• Global maker-breaker games on sparse graphs
• Asymptotic random graph intuition for the biased connectivity game
• Fast embedding of spanning trees in biased maker-breaker games

Cited in

(5)

• Three-person spanning tree games
• Connector-breaker games on random boards
• On strong avoiding games
• On a base exchange game on bispanning graphs
• Walker-breaker games on \(G_{n, p}\)

This page was built for publication: Spanning tree game as prim would have played

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584660)