Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Connect Four and Graph Decomposition

Abstract : We introduce the standard decomposition, a way of decomposing a labeled graph into a sum of certain labeled subgraphs. We motivate this graph-theoretic concept by relating it to Connect Four decompositions of standard sets. We prove that all standard decompositions can be generated in polynomial time, which implies that all Connect Four decompositions can be generated in polynomial time.
Complete list of metadata
Contributor : Laurent Evain Connect in order to contact the contributor
Submitted on : Tuesday, April 16, 2013 - 3:42:39 PM
Last modification on : Wednesday, October 20, 2021 - 3:18:43 AM

Links full text


  • HAL Id : hal-00814130, version 1
  • ARXIV : 1210.4367


Laurent Evain, Mathias Lederer, Bjarke Hammersholt Roune. Connect Four and Graph Decomposition. 2013. ⟨hal-00814130⟩



Record views