Recommendations
Cites work
- scientific article; zbMATH DE number 3839974 (Why is no real title available?)
- scientific article; zbMATH DE number 3877237 (Why is no real title available?)
- scientific article; zbMATH DE number 3900800 (Why is no real title available?)
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 4035609 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3539030 (Why is no real title available?)
- scientific article; zbMATH DE number 3435527 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- A Combinatorial Problem Which Is Complete in Polynomial Space
- On Ringeisen's isolation game
- On deciding switching equivalence of graphs
- On the set coincidence game
- Switchings Constrained to 2-Connectivity in Simple Graphs
- The set coincidence game: Complexity, attainability, and symmetric strategies
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
- Variations on a 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)