1NAUTY-GENGL(1)                   Nauty Manual                   NAUTY-GENGL(1)
2
3
4

NAME

6       nauty-gengL - generate small graphs (L1 flavour)
7

SYNOPSIS

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

DESCRIPTION

13              Generate all graphs of a specified class.
14
15       n      : the number of vertices
16
17              mine:maxe : a range for the number of edges
18
19              #:0 means '# or more' except in the case 0:0
20
21              res/mod : only generate subset res out of subsets 0..mod-1
22
23       -c     : only write connected graphs
24
25       -C     : only write biconnected graphs
26
27       -t     : only generate triangle-free graphs
28
29       -f     : only generate 4-cycle-free graphs
30
31       -p     : only generate 5-cycle-free graphs
32
33       -k     : only generate K4-free graphs
34
35       -T     : only generate chordal graphs
36
37       -S     : only generate split graphs
38
39       -P     : only generate perfect graphs
40
41       -F     : only generate claw-free graphs
42
43       -b     : only generate bipartite graphs
44
45              (-t, -f and -b can be used in any combination)
46
47       -m     : save memory at the expense of time (only makes a
48
49              difference in the absence of -b, -t, -f and n <= 28).
50
51       -d#    : a lower bound for the minimum degree
52
53       -D#    : an upper bound for the maximum degree
54
55       -v     : display counts by number of edges
56
57       -l     : canonically label output graphs
58
59       -u     : do not output any graphs, just generate and count them
60
61       -g     : use graph6 output (default)
62
63       -s     : use sparse6 output
64
65       -h     : for graph6 or sparse6 format, write a header too
66
67       -q     : suppress auxiliary output (except from -v)
68
69              See program text for much more information.
70
71
72
73nauty 2.8.8                      November 2023                  NAUTY-GENGL(1)