The program "partition1" checks if all admissible sequences (see "Decompositions of pseudographs into closed trails of even sizes" for the definition) are realizable in a given graph G (and provides us with these G-realizations). If it is not so, the program stops and gives a negative answer together with a counterexample. 

To work properly, the program needs an input file "G.txt", in which a graph is defined (the structure of this file is quite simple and is roughly described in the source code of the program). All the necessary (in view of the article "Decompositions of pseudographs into closed trails of even sizes") input files "G.txt" are provided in a catalogue "graphs."
(Warning: The input files are prepared in a special manner. If one tries to prepare input files by themselves, the program may become ineffective if the number of edges exceeds 32, that is 8 vertices in our case.)

The final product of the program "partition1" is the resulting file "Greal.txt", which includes all the necessary information.

In case of any additional questions or doubts, do not hesitate to contact us on przybylo@wms.mat.agh.edu.pl.

P.S. For the source code of the program see "partition.cpp."