nauty-geng1

Generate small graphs

Usage

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

Overview

	Generate all graphs of a specified class.
`n`	: 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

-c: : only write connected graphs

-C: : only write biconnected graphs

-t: : only generate triangle-free graphs

-f: : only generate 4-cycle-free graphs

-p: : only generate 5-cycle-free graphs

-k: : only generate K4-free graphs

-T: : only generate chordal graphs

-S: : only generate split graphs

-P: : only generate perfect graphs

-F: : only generate claw-free graphs

-b: : only generate bipartite graphs

: (-t, -f and -b can be used in any combination) The combination -bT gives bipartite graphs with no

: induced cycles longer than 4-cycles.

-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#: : an 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

-h: : for graph6 or sparse6 format, write a header too

-q: : suppress auxiliary output (except from -v)

: See program text for much more information.

Releases

5 releases since Debian 9 (Stretch); the text changed 4 times.

-F since Debian 12 (Bookworm); -P since Debian 12 (Bookworm); -S since Debian 12 (Bookworm); -T since Debian 12 (Bookworm); -k since Debian 12 (Bookworm); -p since Debian 13 (Trixie).

-y until Debian 10 (Buster).