Domination games on infinite graphs

DOI10.1016/0304-3975(94)00032-8zbMath0819.90148OpenAlexW2068794741MaRDI QIDQ1334671

Imre Leader, Reinhard Diestel

Publication date: 25 September 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00032-8

zbMATH Keywords

infinite gamescountable graphwinning strategiesstructural characterization of the graphs

Mathematics Subject Classification ID

Games involving graphs (91A43)

Cites Work

• The strict determinateness of certain infinite games
• A proof of the bounded graph conjecture
• Borel determinacy
• Dominating Functions and Graphs

This page was built for publication: Domination games on infinite graphs