On Ringeisen's isolation game

DOI10.1016/0012-365X(90)90249-HzbMATH Open0714.90108OpenAlexW2028175479MaRDI QIDQ751522FDOQ751522

Authors: D. Kharzeev 

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90249-h

Recommendations

• On Ringeisen's isolation game. II
• The isolation game for regular graphs
• scientific article; zbMATH DE number 4181366
• On the set coincidence game
• The toucher-isolator game

zbMATH Keywords

complexity resultIsolation Game

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Two-Processor Scheduling with Start-Times and Deadlines
• On deciding switching equivalence of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• Switchings Constrained to 2-Connectivity in Simple Graphs
• Generalized Petersen graphs which are cycle permutation graphs

Cited In (7)

• On the set coincidence game
• The set coincidence game: Complexity, attainability, and symmetric strategies
• The isolation game for regular graphs
• An Ore-type condition for cyclability
• A strategy for isolator in the toucher-isolator game on trees
• The toucher-isolator game
• On Ringeisen's isolation game. II

This page was built for publication: On Ringeisen's isolation game

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