Rechercher une page de manuel

Chercher une autre page de manuel:

genbg

Langue: en

Version: 332135 (ubuntu - 24/10/10)

Section: 1 (Commandes utilisateur)

NAME

genbg - [mine[:maxe]] [res/mod] [file]

SYNOPSIS

genbg [-c -ugsn -vq -lzF] [-Z#] [-d#|-d#:#] [-D#|-D#:#] n1 n2

DESCRIPTION

[mine[:maxe]] [res/mod] [file]
Find all bicoloured graphs of a specified class.
n1
: the number of vertices in the first class
n2
: the number of vertices in the second 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 (defailt stdout)
-c
: only write connected graphs
-z
: all the vertices in the second class must have
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
-Z#
: two vertices in the second class may have at most # common nbrs
-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
-n
: use nauty format for output
-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.
Hâtez-vous lentement.
-+- Nicolas Boileau, Art poétique -+-