Man page - nauty-twohamg(1)
Packages contas this manual
- nauty-deledgeg(1)
- nauty-dretog(1)
- nauty-complg(1)
- nauty-pickg(1)
- nauty-dretodot(1)
- nauty-twohamg(1)
- nauty-countneg(1)
- nauty-copyg(1)
- nauty-assembleg(1)
- nauty-countg(1)
- nauty-converseg(1)
- nauty-vcolg(1)
- nauty-ransubg(1)
- nauty-gentreeg(1)
- nauty-shortg(1)
- nauty-catg(1)
- nauty-directg(1)
- nauty-labelg(1)
- nauty-sumlines(1)
- nauty-watercluster2(1)
- nauty-addptg(1)
- nauty-delptg(1)
- nauty-genspecialg(1)
- nauty-addedgeg(1)
- nauty-biplabg(1)
- nauty-nbrhoodg(1)
- nauty-genbg(1)
- nauty-checks6(1)
- nauty-hamheuristic(1)
- nauty-uniqg(1)
- nauty-newedgeg(1)
- nauty-genrang(1)
- nauty-dimacs2g(1)
- nauty-linegraphg(1)
- nauty-genktreeg(1)
- nauty-listg(1)
- nauty-cubhamg(1)
- nauty-edgetransg(1)
- nauty-subdivideg(1)
- dreadnaut(1)
- nauty-ancestorg(1)
- nauty-bliss2dre(1)
- nauty-productg(1)
- nauty-geng(1)
- nauty-genquarticg(1)
- nauty-genposetg(1)
- nauty-underlyingg(1)
- nauty-amtog(1)
- nauty-ranlabg(1)
- nauty-gentourng(1)
- nauty-planarg(1)
- nauty-showg(1)
- nauty-multig(1)
Package: nauty
apt-get install nauty
apt-get install nauty
Manuals in package:
Documentations in package:
Manual
| NAUTY-TWOHAMG(1) | Nauty Manual | NAUTY-TWOHAMG(1) |
NAME
nauty-twohamg - split quartic graphs into two hamiltonian cycles
SYNOPSIS
twohamg [-sgvq] [-L#] [infile [outfile]]
DESCRIPTION
- Partition quartic graphs into two hamiltonian cycles.
- Output those which cannot be partitioned.
- -s
- force output to sparse6 format
- -g
- force output to graph6 format If neither -s or -g are given, the output format is determined by the header or, if there is none, by the format of the first input graph. Also see -S.
- The output file will have a header if and only if the input file does.
- -p
- Read a cubic graph and use its prism. Vertex i of the input becomes
- vertices 2*i,2*i+1 in the prism.
- -x
- Test for decompositions using each 2-path
- -X
- As -x but only output if two 2-paths are missed at some vertex
- -y
- Test for decompositions using each non-triangular 3-path
-t# With -x and -X, consider only paths with center #
- With -y, consider only paths starting at #
- -Y
- With -p, only consider paths whose central edge is vertical
- -v
- Give a partition for those graphs who have one and a message for those which don't. With -x, list exceptional 2-paths.
-L# Limit to 1000*# iterations; write with message if timeout.
- Graphs that time out are written to the output.
- -q
- suppress auxiliary information
| February 2025 | nauty 2.8.9 |