On Ringeisen's isolation game
type: Item
instance of: scholarly article
title: On Ringeisen's isolation game
zbMATH Open document ID: 0714.90108
DOI: 10.1016/0012-365X(90)90249-H
author: D. Kharzeev
published in: Discrete Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 4176869
zbMATH Keywords: Isolation Game
zbMATH Keywords: complexity result
MaRDI profile type: Publication
cites work: Q4114975
cites work: Q5422499
cites work: On deciding switching equivalence of graphs
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: Q3679226
cites work: Q5513521
cites work: Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
cites work: Generalized Petersen graphs which are cycle permutation graphs
cites work: Switchings Constrained to 2-Connectivity in Simple Graphs
full work available at URL: 0012-365x(90)90249-h
OpenAlex ID: W2028175479
description: scientific article; zbMATH DE number 4176869