1NAUTY-GENBG(1) Nauty Manual NAUTY-GENBG(1)
2
3
4
6 nauty-genbg - generate small bicoloured graphs
7
9 genbg [-c -ugs -vq -lzF] [-Z#] [-D#] [-A] [-d#|-d#:#] [-D#|-D#:#] n1 n2
10 [mine[:maxe]] [res/mod] [file]
11
13 Find all bicoloured graphs of a specified class.
14
15 n1 : the number of vertices in the first class
16
17 n2 : the number of vertices in the second class
18
19 mine:maxe : a range for the number of edges
20
21 #:0 means '# or more' except in the case 0:0
22
23 res/mod : only generate subset res out of subsets 0..mod-1
24
25 file : the name of the output file (default stdout)
26
27 -c : only write connected graphs
28
29 -z : all the vertices in the second class must have
30
31 different neighbourhoods
32
33 -F : the vertices in the second class must have at least two
34
35 neighbours of degree at least 2
36
37 -L : there is no vertex in the first class whose removal leaves
38
39 the vertices in the second class unreachable from each other
40
41 -Z# : two vertices in the second class may have at most # common
42 nbrs
43
44 -A : no vertex in the second class has a neighbourhood which is a
45
46 subset of another vertex in the second class
47
48 -D# : specify an upper bound for the maximum degree
49
50 Example: -D6.
51 You can also give separate maxima for the
52
53 two parts, for example: -D5:6
54
55 -d# : specify a lower bound for the minimum degree.
56
57 Again, you can specify it separately for the two parts: -d1:2
58
59 -g : use graph6 format for output (default)
60
61 -s : use sparse6 format for output
62
63 -a : use Greechie diagram format for output
64
65 -u : do not output any graphs, just generate and count them
66
67 -v : display counts by number of edges to stderr
68
69 -l : canonically label output graphs (using the 2-part colouring)
70
71 -q : suppress auxiliary output
72
73 See program text for much more information.
74
75
76
77nauty 2.6.12 October 2019 NAUTY-GENBG(1)