Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Doubly biased maker-breaker connectivity game

From MaRDI portal
Publication:426836
Jump to:navigation, search

zbMath1279.91033arXiv1101.3932MaRDI QIDQ426836

Miloš Stojaković, Dan Hefetz, Mirjana Mikalački

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.3932


zbMATH Keywords

connectivitygames on graphsmaker-breaker gamesbiased games


Mathematics Subject Classification ID

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


Related Items (7)

Winning fast in fair biased maker-breaker games ⋮ Spanning Structures in Walker–Breaker Games ⋮ How fast can maker win in fair biased games? ⋮ Fast winning strategies for staller in the maker-breaker domination game ⋮ Fast strategies in Waiter-Client games ⋮ Generalized pairing strategies -- a bridge from pairing strategies to colorings ⋮ Connector-breaker games on random boards







This page was built for publication: Doubly biased maker-breaker connectivity game

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:426836&oldid=12301643"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:54.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki