The isolation game for regular graphs
From MaRDI portal
Publication:1210561
DOI10.1016/0012-365X(93)90232-IzbMath0786.90106MaRDI QIDQ1210561
Publication date: 30 August 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
91A43: Games involving graphs
Cites Work
- Unnamed Item
- The set coincidence game: Complexity, attainability, and symmetric strategies
- On Ringeisen's isolation game
- On Ringeisen's isolation game. II
- On deciding switching equivalence of graphs
- On the set coincidence game
- Switchings Constrained to 2-Connectivity in Simple Graphs
- Two-Graphs, Switching Classes and Euler Graphs are Equal in Number