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)

Full work available at URL https://doi.org/10.1016/0012-365X(93)90232-I

zbMATH Keywords

isolation game on a graphregular graphs

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
• scientific article; zbMATH DE number 1076137
• Isolation in graphs
• On the Hamiltonicity of the k-regular graph game
• scientific article; zbMATH DE number 2024632
• Schelling games on graphs

Cites work

• scientific article; zbMATH DE number 3435527 (Why is no real title available?)
• On deciding switching equivalence of graphs
• On Ringeisen's isolation game
• On Ringeisen's isolation game. II
• 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

(7)

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

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)