A 13-vertex disproof of the Annor–Howerton graph conjecture, with a structural proof, machine-readable witnesses, and exact verification
-
Updated
Jul 24, 2026 - Python
A 13-vertex disproof of the Annor–Howerton graph conjecture, with a structural proof, machine-readable witnesses, and exact verification
UC3M "Técnicas Avanzadas de Tratamiento de Señal y Comunicaciones" Lab Project
Digital Communication IC Design (2020 Spring)
Research software and verification results for temporal zero forcing on graphs
UC3M "Técnicas Avanzadas de Tratamiento de Señal y Comunicaciones" Lab Project
Add a description, image, and links to the zero-forcing topic page so that developers can more easily learn about it.
To associate your repository with the zero-forcing topic, visit your repo's landing page and select "manage topics."