Man page - nauty-gengl(1)
Packages contas this manual
- nauty-deledgeg(1)
- nauty-dretog(1)
- nauty-complg(1)
- nauty-pickg(1)
- nauty-dretodot(1)
- nauty-twohamg(1)
- nauty-countneg(1)
- nauty-copyg(1)
- nauty-assembleg(1)
- nauty-countg(1)
- nauty-converseg(1)
- nauty-vcolg(1)
- nauty-ransubg(1)
- nauty-gentreeg(1)
- nauty-shortg(1)
- nauty-catg(1)
- nauty-directg(1)
- nauty-labelg(1)
- nauty-sumlines(1)
- nauty-watercluster2(1)
- nauty-addptg(1)
- nauty-delptg(1)
- nauty-genspecialg(1)
- nauty-addedgeg(1)
- nauty-biplabg(1)
- nauty-nbrhoodg(1)
- nauty-genbg(1)
- nauty-checks6(1)
- nauty-hamheuristic(1)
- nauty-uniqg(1)
- nauty-newedgeg(1)
- nauty-genrang(1)
- nauty-dimacs2g(1)
- nauty-linegraphg(1)
- nauty-genktreeg(1)
- nauty-listg(1)
- nauty-cubhamg(1)
- nauty-edgetransg(1)
- nauty-subdivideg(1)
- dreadnaut(1)
- nauty-ancestorg(1)
- nauty-bliss2dre(1)
- nauty-productg(1)
- nauty-geng(1)
- nauty-genquarticg(1)
- nauty-genposetg(1)
- nauty-underlyingg(1)
- nauty-amtog(1)
- nauty-ranlabg(1)
- nauty-gentourng(1)
- nauty-planarg(1)
- nauty-showg(1)
- nauty-multig(1)
Package: nauty
apt-get install nauty
apt-get install nauty
Manuals in package:
Documentations in package:
Manual
| NAUTY-GENGL(1) | Nauty Manual | NAUTY-GENGL(1) |
NAME
nauty-gengL - (L1 flavour)
SYNOPSIS
geng [-cCmtfkbd#D#] [-kTSPF] [-uygsnh] [-lvq] [-x#X#] n [mine[:maxe]] [res/mod] [file]
DESCRIPTION
- 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.
| February 2025 | nauty 2.8.9 |