The Largest Connected Subgraph Game - Archive ouverte HAL Access content directly
Journal Articles Algorithmica Year : 2022

The Largest Connected Subgraph Game


This paper introduces the largest connected subgraph game played on an undirected graph G. In each round, Alice first colours an uncoloured vertex of G red, and then, Bob colours an uncoloured vertex of G blue, with all vertices initially uncoloured. Once all the vertices are coloured, Alice (Bob, resp.) wins if there is a red (blue, resp.) connected subgraph whose order is greater than the order of any blue (red, resp.) connected subgraph. We first prove that, if Alice plays optimally, then Bob can never win, and define a large class of graphs (called reflection graphs) in which the game is a draw. We then show that determining the outcome of the game is PSPACE-complete, even in bipartite graphs of small diameter, and that recognising reflection graphs is GI-hard. We also prove that the game is a draw in paths if and only if the path is of even order or has at least 11 vertices, and that Alice wins in cycles if and only if the cycle is of odd length. Lastly, we give an algorithm to determine the outcome of the game in cographs in linear time.
Fichier principal
Vignette du fichier
The_Largest_Connected_Subgraph_Game.pdf (870.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03655680 , version 1 (29-04-2022)



Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse. The Largest Connected Subgraph Game. Algorithmica, 2022, 84 (9), pp.1030-1063. ⟨10.1007/s00453-022-00973-5⟩. ⟨hal-03655680⟩
39 View
41 Download



Gmail Facebook Twitter LinkedIn More