On Ringeisen's isolation game

DOI10.1016/0012-365X(90)90249-HzbMath0714.90108OpenAlexW2028175479MaRDI QIDQ751522

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

zbMATH Keywords

complexity resultIsolation Game

Mathematics Subject Classification ID

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

Related Items (5)

On the set coincidence game ⋮ The isolation game for regular graphs ⋮ An Ore-type condition for cyclability ⋮ The set coincidence game: Complexity, attainability, and symmetric strategies ⋮ On Ringeisen's isolation game. II

Cites Work

• Generalized Petersen graphs which are cycle permutation graphs
• On deciding switching equivalence of graphs
• Switchings Constrained to 2-Connectivity in Simple Graphs
• Two-Processor Scheduling with Start-Times and Deadlines
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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