TWOHAMG(1)

πŸ“¦
version 2.9.3 Β· 3 versions
, in fedora 43, fedora 44

πŸ’– TWOHAMG πŸ’–

okay bestie, sit down, hydrate, because we're about to talk about twohamg β€” it's the manual page for twohamg version 2.9.3 and it is so much cooler than it sounds. graph theory girlies rise 🫢


✨ SYNOPSIS ✨

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

yes it's short. yes it goes hard. no notes. πŸ’…


🌸 DESCRIPTION 🌸

Partition quartic graphs into two hamiltonian cycles.

...and then it just outputs the ones that can't be partitioned. iconic behaviour honestly, it's giving "I only speak up when something's wrong" main character energy 😭

That's it. That's the whole job. Split the graph into two hamiltonian cycles, and if that's impossible, bestie gets a write-out. no cap.


πŸŽ€ OPTIONS πŸŽ€

  • -s β€” force output to sparse6 format ✨
  • -g β€” force output to graph6 format ✨
ngl, if you give it neither -s nor -g, the output format is decided by the header, or β€” if there's no header at all β€” by the format of the first input graph. also see -S. πŸ‘€
πŸ¦‹ and listen: the output file will have a header if and only if the input file does. if and only if!! it's matching energy, it's twin flames, it's literally mirrored.
  • -p β€” read a cubic graph and use its prism. Vertex i of the input becomes vertices 2*i, 2*i+1 in the prism. lowkey a glow-up transformation fr fr ✨
  • -x β€” test for decompositions using each 2-path 🌈
  • -X β€” as -x but only output if two 2-paths are missed at some vertex. yes it's the louder sibling. it's the same but it only speaks up when two 2-paths get 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 #. so basically # is the VIP of your path selection, iykyk πŸ’…
  • -Y β€” with -p, only consider paths whose central edge is vertical πŸ“
  • -v β€” give a partition for those graphs which have one, and a message for those which don't. and with -x, it lists the exceptional 2-paths too. it's chatty! we love a talkative queen πŸ’–
  • -L# β€” limit to 1000*# iterations; write with message if timeout. and heads up: graphs that time out are written to the output. so if it runs out of patience, it still leaves a note. respectful, honestly. 😭
  • -q β€” suppress auxiliary information. for when you want the ✨bare minimum✨ and no side commentary. (rude but valid.)

πŸ’€ quick vibe check: -x, -X, -y, -t#, and -Y all interact with each other, so read the little bullet notes before you mash flags together. fr fr. don't just yeet them in there.

twohamg 2.9.3 Β· September 2026 β€” mwah, that's the whole page bestie, go partition some quartic graphs and slay πŸ’…βœ¨πŸ¦‹πŸ’–

πŸ“¦ where this page comes from
  • fedora 43: nauty 2.9.3-3.fc43 Β· Apache-2.0 AND LicenseRef-Fedora-Public-Domain AND Knuth-CTAN AND GPL-1.0-or-later
  • fedora 44: nauty 2.9.3-4.fc44 Β· Apache-2.0 AND LicenseRef-Fedora-Public-Domain AND Knuth-CTAN AND GPL-1.0-or-later
  • πŸ’– girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms