geng(1)
NAME
geng - [-x#X#] n [mine[:maxe]] [res/mod] [file]
SYNOPSIS
geng [-cCmtfbd#D#] [-uygsnh] [-lvq]
DESCRIPTION
[-x#X#] n [mine[:maxe]] [res/mod] [file]
- Generate all graphs of a specified class.
- n : the number of vertices (1..32)
mine:maxe : a range for the number of edges- #:0 means '# or more' except in the case 0:0
- res/mod : only generate subset res out of subsets 0..mod-1
- -c : only write connected graphs
- -C : only write biconnected graphs
- -t : only generate triangle-free graphs
- -f : only generate 4-cycle-free graphs
- -b : only generate bipartite graphs
(-t, -f and -b can be used in any combination)- -m : save memory at the expense of time (only makes a
difference in the absence of -b, -t, -f and n <= 28).- -d# : a lower bound for the minimum degree
- -D# : a upper bound for the maximum degree
- -v : display counts by number of edges
- -l : canonically label output graphs
- -u : do not output any graphs, just generate and count them
- -g : use graph6 output (default)
- -s : use sparse6 output
- -y : use the obsolete y-format instead of graph6 format
- -h : for graph6 or sparse6 format, write a header too
- -q : suppress auxiliary output (except from -v)
See program text for much more information.