.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.48.2.
.TH NAUTY-CUBHAMG "1" "March 2021" "nauty 2.7.1" "Nauty Manual"
.SH NAME
nauty-cubhamg \- find hamiltonian cycles in subcubic graphs
.SH SYNOPSIS
.B cubhamg
[\fI\,-#\/\fR] [\fI\,-v|-V\/\fR] [\fI\,-n#-#|-y#-#|-i|-I|-o|-x|-e|-E\/\fR] [\fI\,-b|-t\/\fR] [\fI\,infile \/\fR[\fI\,outfile\/\fR]]
.SH DESCRIPTION
.IP
Pick those inputs that are nonhamiltonian and have max degree <= 3.
.IP
infile is the name of the input file in graph6/sparse6 format (default: stdin)
.IP
outfile is the name of the output file in the same format (default: stdout)
.IP
The output file will have a header >>graph6<< or >>sparse6<< if the input file does.
.SH OPTIONS
.TP
\-#
A parameter useful for tuning (default 100)
.TP
\fB\-v\fR
Report nonhamiltonian graphs and noncubic graphs
.TP
\fB\-V\fR
\&.. in addition give a cycle for the hamiltonian ones
.TP
\fB\-n\fR#\-#
If the two numbers are v and i, then the i\-th edge
out of vertex v is required to be not in the cycle.
It must be that i=1..3 and v=0..n\-1.
.TP
\fB\-y\fR#\-#
If the two numbers are v and i, then the i\-th edge
out of vertex v is required to be in the cycle.
It must be that i=1..3 and v=0..n\-1.
You can use any number of \fB\-n\fR/\-y switches to force
edges.  Out of range first arguments are ignored.
If \fB\-y\fR and \fB\-n\fR give same edge, \fB\-y\fR wins.
.TP
\fB\-i\fR
Test + property: for each edge e, there is a hamiltonian cycle using e.
.TP
\fB\-I\fR
Test ++ property: for each pair of edges e,e', there is
a hamiltonian cycle which uses both e and e'.
.TP
\fB\-o\fR
Test \- property: for each edge e, there is a hamiltonian cycle avoiding e.
.TP
\fB\-x\fR
Test +\- property: for each pair of edges e,e', there is
a hamiltonian cycle which uses e but avoids e'.
.TP
\fB\-e\fR
Test 3/4 property: for each edge e, at least 3 of the 4
paths of length 3 passing through e lie on hamiltonian cycles.
.TP
\fB\-E\fR
Test 3/4+ property: for each edge e failing the 3/4 property,
all three ways of joining e to the rest of the graph are
hamiltonian avoiding e.
.TP
\fB\-T\fR#
Specify a timeout, being a limit on how many search tree
nodes are made.  If the timeout occurs, the graph is
written to the output as if it is nonhamiltonian.
.TP
\fB\-R\fR#
Specify the number of repeat attempts for each stage.
.TP
\fB\-F\fR
Analyze covering paths from 2 or 4 vertices of degree 2.
.TP
\fB\-b\fR
Require biconnectivity
.TP
\fB\-t\fR
Require triconnectivity  (note: quadratic algorithm)
.SS "Comments:"
.HP
\fB\-y\fR, \fB\-n\fR, \-#, \fB\-R\fR and \fB\-T\fR are ignored for \fB\-i\fR, \fB\-I\fR, \fB\-x\fR, \fB\-o\fR, \fB\-e\fR, \fB\-E\fR, \fB\-F\fR