On structural parameterizations of Node Kayles

DOI10.1007/978-3-030-90048-9_8MaRDI QIDQ2695476zbMATH OpenOpenAlexFDO

Authors Yasuaki Kobayashi

Publication date 31 March 2023

Full work available at URL https://arxiv.org/abs/2003.11775

zbMATH Keywords

fixed-parameter tractabilityNode Kaylesstructural parameterization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Applications of game theory (91A80)

Recommendations

• Compound Node-Kayles on paths
• Structure of node polynomials for curves on surfaces
• Mathematics of Surfaces
• Node polynomials for families: methods and applications
• NODAL PARITY INVARIANTS OF KNOTTED RIGID VERTEX GRAPHS
• Nodal decompositions of graphs
• scientific article; zbMATH DE number 89391
• scientific article; zbMATH DE number 179275
• A Classification of Nodes for Structural Controllability
• A General Family of Nodal Schemes

Cites work

• Exact algorithms for Kayles
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
• scientific article; zbMATH DE number 1003286 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 1568491 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Kayles and Nimbers
• On the complexity of some two-person perfect-information games

Cited in

(4)

• Winner determination algorithms for graph games with matching structures
• Winner determination algorithms for graph games with matching structures
• On Structural Parameterizations of Node Kayles
• Faster winner determination algorithms for (colored) Arc Kayles

This page was built for publication: On structural parameterizations of Node Kayles

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