Kayles and Nimbers

DOI10.1006/jagm.2002.1215zbMath1005.68112OpenAlexW2026121858WikidataQ59567897 ScholiaQ59567897MaRDI QIDQ3150277

Dieter Kratsch, Hans L. Bodlaender

Publication date: 30 September 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2002.1215

zbMATH Keywords

KaylesSprague-Grundy theory

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

Winner determination algorithms for graph games with matching structures ⋮ Combinatorial analysis of a subtraction game on graphs ⋮ Impartial coloring games ⋮ Games on interval and permutation graph representations ⋮ On structural parameterizations of Node Kayles ⋮ Exact algorithms for Kayles ⋮ A generalization of \textsc{Arc-Kayles} ⋮ Winner determination algorithms for graph games with matching structures ⋮ Unnamed Item ⋮ Compound Node-Kayles on paths ⋮ Exact Algorithms for Kayles ⋮ Games on triangulations

This page was built for publication: Kayles and Nimbers