The isolation game for regular graphs

DOI10.1016/0012-365X(93)90232-IMaRDI QIDQ1210561zbMATH OpenFDO

Authors 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)

Recommendations

• Component games on regular graphs
• Algorithms – ESA 2005
• A connectivity game for graphs
• Game connectivity of graphs
• Graph games and edge density of graphs
• Publication:4359580
• Isolation in graphs
• On the Hamiltonicity of the \(k\)-regular graph game
• Publication:4443209
• Schelling games on graphs

Cites work

• scientific article; zbMATH DE number 3435527 (Why is no real title available?)
• 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
• The set coincidence game: Complexity, attainability, and symmetric strategies
• Two-Graphs, Switching Classes and Euler Graphs are Equal in Number

Cited in

(6)

• The toucher-isolator game
• The set coincidence game: Complexity, attainability, and symmetric strategies
• The topology of competitively constructed graphs
• On Ringeisen's isolation game
• An Ore-type condition for cyclability
• A strategy for isolator in the toucher-isolator game on trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1210561)