The isolation game for regular graphs

DOI10.1016/0012-365X(93)90232-IzbMath0786.90106MaRDI QIDQ1210561

S. Singh

Publication date: 30 August 1993

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

zbMATH Keywords

regular graphsisolation game on a graph

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (2)

An Ore-type condition for cyclability ⋮ The set coincidence game: Complexity, attainability, and symmetric strategies

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

This page was built for publication: The isolation game for regular graphs