On Ringeisen's isolation game. II

DOI10.1016/0012-365X(91)90353-4zbMath0727.90100OpenAlexW4213197520MaRDI QIDQ804481

N. E. Zubov

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90353-4

zbMATH Keywords

best playRingeisen's isolation gameswitching operation

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Graph theory (05C99)

Related Items (1)

The isolation game for regular graphs

Cites Work

• The set coincidence game: Complexity, attainability, and symmetric strategies
• On Ringeisen's isolation game
• On deciding switching equivalence of graphs
• Variations on a game
• On the set coincidence game
• Switchings Constrained to 2-Connectivity in Simple Graphs
• A Combinatorial Problem Which Is Complete in Polynomial Space
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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