Your company here ā€” click to reach over 10,000 unique daily visitors

nauty-geng - Man Page

generate small graphs


geng [-cCmtfkbd#D#] [-kTSPF] [-uygsnh] [-lvq] [-x#X#] n [mine[:maxe]] [res/mod] [file]


Generate all graphs of a specified class.


: the number of vertices

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


: only write connected graphs


: only write biconnected graphs


: only generate triangle-free graphs


: only generate 4-cycle-free graphs


: only generate 5-cycle-free graphs


: only generate K4-free graphs


: only generate chordal graphs


: only generate split graphs


: only generate perfect graphs


: only generate claw-free graphs


: only generate bipartite graphs

(-t, -f and -b can be used in any combination)


: save memory at the expense of time (only makes a

difference in the absence of -b, -t, -f and n <= 28).


: a lower bound for the minimum degree


: an upper bound for the maximum degree


: display counts by number of edges


: canonically label output graphs


: do not output any graphs, just generate and count them


: use graph6 output (default)


: use sparse6 output


: for graph6 or sparse6 format, write a header too


: suppress auxiliary output (except from -v)

See program text for much more information.


April 2024 nauty 2.8.8 Nauty Manual