nauty-gengL1
(l1 flavour)
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,-fand-bcan be used in any combination) The combination-bTgives 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,-fand 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
2 releases since Debian 12 (Bookworm); the text changed 1 time.
-p since Debian 13 (Trixie).