Graph explorer

Canonical binary $Δ$-matroids

The handle slide operation, originally defined for ribbon graphs, was extended to delta-matroids by I. Moffatt and E. Mphako-Bandab, who show that, using a delta-matroid analogue of handle slides, every binary delta-matroid in which the empty set is feasible can be written in a canonical form analogous to the canonical form for one-vertex maps on a surface. We provide a canonical form for binary delta-matroids without restriction on the feasibility of the empty set.