GENBGL(1)

🌸 NAME 🌸

bestie. listen. this is genbgL — the manual page for genbgL version 2.9.3. that's it, that's the name section, she's short and she knows it 💅

---

✨ SYNOPSIS ✨

genbg [-c -ugs -vq -lzF] [-Z#] [-D#] [-A] [-d#|-d#:#] [-D#|-D#:#] n1 n2
[mine[:maxe]] [res/mod] [file]

---

💖 DESCRIPTION 💖

okay so the whole vibe here is: find all bicoloured graphs of a specified class. that's the mission, that's the assignment, and she is obsessed with it 🦋

here's what all the little pieces mean, one by one, no gatekeeping:

• 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 👀 (yes, that one's special, she's built different)
• res/mod — only generate subset res out of subsets 0..mod-1
• file — the name of the output file (default stdout)

---

🎀 OPTIONS 🎀

• -c — only write connected graphs. no lonely little islands allowed 💅
• -z — all the vertices in the second class must have different neighbourhoods. no twinning, no copying, everyone's unique ✨
• -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. counting era, not sharing era 🔢
• -v — display counts by number of edges to stderr
• -l — canonically label output graphs (using the 2-part colouring)
• -q — suppress auxiliary output. shhh 🤫

See program text for much more information. (fr fr, she's holding back, go read the source bestie 📖)

---

genbgL 2.9.3 · September 2026 · GENBGL(1)

that's the whole page 🫶 go forth and generate some bicoloured graphs, you absolute main character 👑💖