Site

## Testing Bound SPG

Testing if a graph of odd-girth 2k+1 bounds all K_4-minor free graphs of odd-girth 2k+1

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 and edge-colourings of K4-minor-free graphs. J. Combin. Theory, Ser. B, 124 (2017), 128–164.

It would test if a given graph of odd-girth 2k+1 bounds all K4-minor free graphs of odd-girth at least 2k+1.