Man page - nauty-genbgl(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-GENBGL(1) | Nauty Manual | NAUTY-GENBGL(1) |
NAME
nauty-genbgL - (L1 flavour)
SYNOPSIS
genbg [-c -ugs -vq -lzF] [-Z#] [-D#] [-A] [-d#|-d#:#] [-D#|-D#:#] n1 n2 [mine[:maxe]] [res/mod] [file]
DESCRIPTION
- Find all bicoloured graphs of a specified class.
- 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
- file : the name of the output file (default stdout)
- different neighbourhoods
- -F
- : the vertices in the second class must have at least two
- neighbours of degree at least 2
- -L
- : there is no vertex in the first class whose removal leaves
- the vertices in the second class unreachable from each other
- -Y#
- : two vertices in the second class must have at least # common nbrs
- -Z#
- : two vertices in the second class must have at most # common nbrs
- -A
- : no vertex in the second class has a neighbourhood which is a
- subset of another vertex's neighbourhood in the second class
- -D#
- : specify an upper bound for the maximum degree
- Example: -D6.
- You can also give separate maxima for the
- two parts, for example: -D5:6
- -d#
- : specify a lower bound for the minimum degree.
- Again, you can specify it separately for the two parts: -d1:2
- -g
- : use graph6 format for output (default)
- -s
- : use sparse6 format for output
- -a
- : use Greechie diagram format for output
- -u
- : do not output any graphs, just generate and count them
- -v
- : display counts by number of edges to stderr
- -l
- : canonically label output graphs (using the 2-part colouring)
- -q
- : suppress auxiliary output
- See program text for much more information.
| February 2025 | nauty 2.8.9 |