Connect four and graph decomposition

DOI10.1007/s00037-016-0123-1zbMath1349.05013arXiv1210.4367OpenAlexW2962828423MaRDI QIDQ347118

Bjarke Hammersholt Roune, Laurent Evain, Mathias Lederer

Publication date: 30 November 2016

Published in: Computational Complexity (Search for Journal in Brave)

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

zbMATH Keywords

labeled graphspolynomial time complexitystandard sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• La methode d'Horace pour l'interpolation à plusieurs variables
• On the postulation of \(s^d\) fat points in \(\mathbb P^d\)
• On vector partition functions
• The vanishing ideal of a finite set of closed points in affine space
• Components of Gröbner strata in the Hilbert scheme of points

This page was built for publication: Connect four and graph decomposition