Domination games on infinite graphs
type: Item
instance of: scholarly article
title: Domination games on infinite graphs
zbMATH Open document ID: 0819.90148
DOI: 10.1016/0304-3975(94)00032-8
author: Reinhard Diestel
author: Imre Leader
published in: Theoretical Computer Science
publication date: 1994-09-25T00:00:00Z
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 643680
zbMATH Keywords: infinite games
zbMATH Keywords: countable graph
zbMATH Keywords: structural characterization of the graphs
zbMATH Keywords: winning strategies
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00032-8
OpenAlex ID: W2068794741
cites work: A proof of the bounded graph conjecture
cites work: Dominating Functions and Graphs
cites work: Borel determinacy
cites work: The strict determinateness of certain infinite games
Recommended article: Domination Games Played on Graphs
Recommended article: Infinite games played on finite graphs
Recommended article: Domination game on uniform hypergraphs
Recommended article: An Introduction to Game Domination in Graphs
Recommended article: Infinite Games on Finite Graphs Using Grossone
Recommended article: Infinite games on finite graphs using grossone
Recommended article: Perfect graphs for domination games
Recommended article: The domination game played on unions of graphs
Recommended article: On graphs with largest possible game domination number
Recommended article: Infinite versus finite graph domination
description: scientific article; zbMATH DE number 643680