The largest connected subgraph game

DOI10.1007/978-3-030-86838-3_23OpenAlexW3137090254MaRDI QIDQ5925553

Nicolas Nisse, Julien Bensmail, Fionn Mc Inerney, Foivos Fioravantes

Publication date: 8 June 2022

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-03219636/file/The_Largest_Connected_Subgraph_Game%285%29%20%281%29.pdf

zbMATH Keywords

games on graphsPSPACE-completeconnection gamesscoring games

Mathematics Subject Classification ID

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

Related Items (2)

On a vertex-capturing game ⋮ The largest connected subgraph game

Cites Work

• Unnamed Item
• On the complexity of connection games
• Guaranteed scoring games
• Occupation games on graphs in which the second player takes almost all vertices
• Hex ist Pspace-vollständig. (Hex is Pspace-complete)
• On the complexity of some two-person perfect-information games
• Games with guaranteed scores and waiting moves
• \textsc{influence}: a partizan scoring game on graphs
• On the role of 3s for the 1--2--3 conjecture
• The orthogonal colouring game
• A Linear Recognition Algorithm for Cographs
• A Combinatorial Problem Which Is Complete in Polynomial Space
• A Graph-Grabbing Game

This page was built for publication: The largest connected subgraph game