Finding Graph Decompositions via SAT

We begin a systematic study of how Graph Decomposition problems may be represented using propositional formulas, and hence solved using SAT-solver technology. By making use of symmetry breaking techniques we are able to obtain solutions to several previously unknown cases and to significantly reduce the time needed to compute decompositions. However some fairly small instances remain unsolved, and thus provide an interesting challenge to SAT-solver technology.