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 <>
Submitted on : Tuesday, April 16, 2013 - 3:42:39 PM
Last modification on : Monday, March 9, 2020 - 6:16:02 PM

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