1NAUTY-TWOHAMG(1)                 Nauty Manual                 NAUTY-TWOHAMG(1)
2
3
4

NAME

6       nauty-twohamg - split quartic graphs into two hamiltonian cycles
7

SYNOPSIS

9       twohamg [-sgvq] [-L#] [infile [outfile]]
10

DESCRIPTION

12              Partition quartic graphs into two hamiltonian cycles.
13
14              Output those which cannot be partitioned.
15
16       -s     force output to sparse6 format
17
18       -g     force output to graph6 format If neither -s or -g are given, the
19              output format is determined by the header or, if there is  none,
20              by the format of the first input graph. Also see -S.
21
22              The output file will have a header if and only if the input file
23              does.
24
25       -p     Read a cubic graph and use its prism.  Vertex  i  of  the  input
26              becomes
27
28              vertices 2*i,2*i+1 in the prism.
29
30       -x     Test for decompositions using each 2-path
31
32       -X     As -x but only output if two 2-paths are missed at some vertex
33
34       -y     Test for decompositions using each non-triangular 3-path
35
36       -t# With -x and -X, consider only paths with center #
37
38              With -y, consider only paths starting at #
39
40       -Y     With -p, only consider paths whose central edge is vertical
41
42       -v     Give a partition for those graphs who have one and a message for
43              those which don't. With -x, list exceptional 2-paths.
44
45       -L# Limit to 1000*# iterations; write with message if timeout.
46
47              Graphs that time out are written to the output.
48
49       -q     suppress auxiliary information
50
51
52
53nauty 2.6.12                     October 2019                 NAUTY-TWOHAMG(1)