" Partition quartic graphs into two hamiltonian cycles.\n\

Output those which cannot be partitioned.\n\

\n\

-s force output to sparse6 format\n\

-g force output to graph6 format\n\

If neither -s or -g are given, the output format is\n\

determined by the header or, if there is none, by the\n\

format of the first input graph. Also see -S. \n\

\n\

The output file will have a header if and only if the input file does.\n\

\n\

-p Read a cubic graph and use its prism. Vertex i of the input becomes\n\

vertices 2*i,2*i+1 in the prism.\n\

-x Test for decompositions using each 2-path\n\

-X As -x but only output if two 2-paths are missed at some vertex\n\

-y Test for decompositions using each non-triangular 3-path\n\

-t# With -x and -X, consider only paths with center #\n\

With -y, consider only paths starting at #\n\

-Y With -p, only consider paths whose central edge is vertical\n\

-v Give a partition for those graphs who have one and a message\n\

for those which don't. With -x, list exceptional 2-paths.\n\

-L# Limit to 1000*# iterations; write with message if timeout.\n\

Graphs that time out are written to the output.\n\

\n\

-q suppress auxiliary information\n"

{

int *addr;

int value;

{

int e1,e2,e3;

int v1,v2,v3,v4;

boolean ok;