On Ringeisen's isolation game. II
From MaRDI portal
Publication:804481
DOI10.1016/0012-365X(91)90353-4zbMATH Open0727.90100OpenAlexW4213197520MaRDI QIDQ804481FDOQ804481
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Combinatorial Problem Which Is Complete in Polynomial Space
- On deciding switching equivalence of graphs
- Variations on a game
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The set coincidence game: Complexity, attainability, and symmetric strategies
- On Ringeisen's isolation game
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
- Switchings Constrained to 2-Connectivity in Simple Graphs
- On the set coincidence game
Cited In (4)
This page was built for publication: On Ringeisen's isolation game. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804481)