Testing if a signed bipartite graph of unbalanced-girth 2k bounds all signed bipartite K_4-minor free graphs of unbalanced-girth 2k

This software, which is based on SAGE, is produced by Florent Foucaud based on the following work:

L. Beaudou, F. Foucaud, R. Naserasr. Homomorphism bounds of signed bipartite $K_4$-minor-free graphs and edge-colourings of $2k$-regular $K_4$-minor-free multigraphs. To appear Disc. Applied Math.

It would test if a given signed bipartite graph of unbalanced-girth 2k bounds all signed bipartite K4-minor free graphs of unbalanced-girth at least 2k.