@article{rashidi2020petersen,
  title        = {Computing the zero forcing number for generalized Petersen graphs},
  author       = {Rashidi, Saeedeh and Poursalavati, Nosratollah Shajareh and Tavakkoli, Maryam},
  journal      = {Journal of Algebra Combinatorics Discrete Structures and Applications},
  year         = {2020},
  volume       = {7},
  number       = {2},
  pages        = {183-193},
  publisher    = {iPeak Academy Ltd.},
  doi          = {10.13069/jacodesmath.729465},
  url          = {https://doi.org/10.13069/jacodesmath.729465},
}
@article{aim2008zeroforcing,
  title        = {Zero forcing sets and the minimum rank of graphs},
  author       = {AIM Minimum Rank – Special Graphs Work Group},
  journal      = {Linear Algebra and its Applications},
  year         = {2008},
  volume       = {428},
  number       = {7},
  pages        = {1628-1648},
  publisher    = {Elsevier BV},
  doi          = {10.1016/j.laa.2007.10.009},
  url          = {https://doi.org/10.1016/j.laa.2007.10.009},
}
@article{arxiv2610_24059,
  title        = {Sharp zero forcing numbers for the generalized Petersen graphs $P(n,3)$ and $P(n,4)$},
  author       = {Arnav Krishnan and Haobo Ma and Wenlin Zhang},
  journal      = {arXiv preprint arXiv:2610.24059},
  year         = {2026},
  eprint       = {2610.24059},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url          = {https://arxiv.org/abs/2610.24059},
}
@article{arxiv2607_19412,
  title        = {A correction to the Zero Forcing Number of the Generalized Petersen Graphs $P(n,3)$},
  author       = {Arnav Krishnan},
  journal      = {arXiv preprint arXiv:2607.19412},
  year         = {2026},
  eprint       = {2607.19412},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url          = {https://arxiv.org/abs/2607.19412},
}
@article{brimkov2019computational,
  title        = {Computational approaches for zero forcing and related problems},
  author       = {Brimkov, Boris and Fast, Caleb C. and Hicks, Illya V.},
  journal      = {European Journal of Operational Research},
  year         = {2019},
  volume       = {273},
  number       = {3},
  pages        = {889-903},
  publisher    = {Elsevier BV},
  doi          = {10.1016/j.ejor.2018.09.030},
  url          = {https://doi.org/10.1016/j.ejor.2018.09.030},
}
@article{brimkov2021improved,
  title        = {Improved Computational Approaches and Heuristics for Zero Forcing},
  author       = {Brimkov, Boris and Mikesell, Derek and Hicks, Illya V.},
  journal      = {INFORMS Journal on Computing},
  year         = {2021},
  publisher    = {Institute for Operations Research and the Management Sciences (INFORMS)},
  doi          = {10.1287/ijoc.2020.1032},
  url          = {https://doi.org/10.1287/ijoc.2020.1032},
}
@article{alameda2018families,
  title        = {Families of graphs with maximum nullity equal to zero forcing number},
  author       = {Alameda, Joseph S. and Curl, Emelie and Grez, Armando and Hogben, Leslie and Kingston, O’Neill and Schulte, Alex and Young, Derek and Young, Michael},
  journal      = {Special Matrices},
  year         = {2018},
  volume       = {6},
  number       = {1},
  pages        = {56-67},
  publisher    = {Walter de Gruyter GmbH},
  doi          = {10.1515/spma-2018-0006},
  url          = {https://doi.org/10.1515/spma-2018-0006},
}
@article{watkins1969tait,
  title        = {A theorem on tait colorings with an application to the generalized Petersen graphs},
  author       = {Watkins, Mark E.},
  journal      = {Journal of Combinatorial Theory},
  year         = {1969},
  volume       = {6},
  number       = {2},
  pages        = {152-164},
  publisher    = {Elsevier BV},
  doi          = {10.1016/s0021-9800(69)80116-x},
  url          = {https://doi.org/10.1016/s0021-9800(69)80116-x},
}
@article{frucht1971groups,
  title        = {The groups of the generalized Petersen graphs},
  author       = {Frucht, Roberto and Graver, Jack E. and Watkins, Mark E.},
  journal      = {Mathematical Proceedings of the Cambridge Philosophical Society},
  year         = {1971},
  volume       = {70},
  number       = {2},
  pages        = {211-218},
  publisher    = {Cambridge University Press (CUP)},
  doi          = {10.1017/s0305004100049811},
  url          = {https://doi.org/10.1017/s0305004100049811},
}
@incollection{wetzler2014drattrim,
  title        = {DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs},
  author       = {Wetzler, Nathan and Heule, Marijn J. H. and Hunt, Warren A.},
  booktitle    = {Lecture Notes in Computer Science},
  year         = {2014},
  pages        = {422-429},
  publisher    = {Springer International Publishing},
  doi          = {10.1007/978-3-319-09284-3\_31},
  url          = {https://doi.org/10.1007/978-3-319-09284-3\_31},
}
@article{cameron2023forts,
  title        = {Forts, (fractional) zero forcing, and Cartesian products of graphs},
  author       = {Thomas R. Cameron and Leslie Hogben and Franklin H. J. Kenter and Seyed Ahmad Mojallal and Houston Schuerger},
  journal      = {arXiv preprint arXiv:2310.17904},
  year         = {2023},
  eprint       = {2310.17904},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url          = {https://arxiv.org/abs/2310.17904},
}
@article{davila2015girth,
  title        = {Bounds for the Zero Forcing Number of Graphs with Large Girth},
  author       = {Davila, Randy and Kenter, Franklin},
  journal      = {Theory and Applications of Graphs},
  year         = {2015},
  volume       = {2},
  number       = {2},
  publisher    = {Georgia Southern University},
  doi          = {10.20429/tag.2015.020201},
  url          = {https://doi.org/10.20429/tag.2015.020201},
}
@article{hogben2012propagation,
  title        = {Propagation time for zero forcing on a graph},
  author       = {Hogben, Leslie and Huynh, My and Kingsley, Nicole and Meyer, Sarah and Walker, Shanise and Young, Michael},
  journal      = {Discrete Applied Mathematics},
  year         = {2012},
  volume       = {160},
  number       = {13-14},
  pages        = {1994-2005},
  publisher    = {Elsevier BV},
  doi          = {10.1016/j.dam.2012.04.003},
  url          = {https://doi.org/10.1016/j.dam.2012.04.003},
}
@article{bjorkman2025leaky,
  title        = {Leaky Forcing: Extending Zero Forcing Results to a Fault-Tolerant Setting},
  author       = {Beth Bjorkman and Lei Cao and Franklin Kenter and Ryan Moruzzi and Carolyn Reinhart and Violeta Vasilevska},
  journal      = {arXiv preprint arXiv:2508.02564},
  year         = {2025},
  eprint       = {2508.02564},
  archivePrefix = {arXiv},
  primaryClass = {math.CO},
  url          = {https://arxiv.org/abs/2508.02564},
}
@article{fast2018degrees,
  title        = {Effects of vertex degrees on the zero-forcing number and propagation time of a graph},
  author       = {Fast, Caleb C. and Hicks, Illya V.},
  journal      = {Discrete Applied Mathematics},
  year         = {2018},
  volume       = {250},
  pages        = {215-226},
  publisher    = {Elsevier BV},
  doi          = {10.1016/j.dam.2018.05.002},
  url          = {https://doi.org/10.1016/j.dam.2018.05.002},
}
@article{barioli2010parameters,
  title        = {Zero forcing parameters and minimum rank problems},
  author       = {Barioli, Francesco and Barrett, Wayne and Fallat, Shaun M. and Hall, H. Tracy and Hogben, Leslie and Shader, Bryan and van den Driessche, P. and van der Holst, Hein},
  journal      = {Linear Algebra and its Applications},
  year         = {2010},
  volume       = {433},
  number       = {2},
  pages        = {401-411},
  publisher    = {Elsevier BV},
  doi          = {10.1016/j.laa.2010.03.008},
  url          = {https://doi.org/10.1016/j.laa.2010.03.008},
}
@incollection{ignatiev2018pysat,
  title        = {PySAT: A Python Toolkit for Prototyping with SAT Oracles},
  author       = {Ignatiev, Alexey and Morgado, Antonio and Marques-Silva, Joao},
  booktitle    = {Lecture Notes in Computer Science},
  year         = {2018},
  pages        = {428-437},
  publisher    = {Springer International Publishing},
  doi          = {10.1007/978-3-319-94144-8\_26},
  url          = {https://doi.org/10.1007/978-3-319-94144-8\_26},
}
@incollection{demoura2021lean4,
  title        = {The Lean 4 Theorem Prover and Programming Language},
  author       = {Moura, Leonardo de and Ullrich, Sebastian},
  booktitle    = {Lecture Notes in Computer Science},
  year         = {2021},
  pages        = {625-635},
  publisher    = {Springer International Publishing},
  doi          = {10.1007/978-3-030-79876-5\_37},
  url          = {https://doi.org/10.1007/978-3-030-79876-5\_37},
}
@incollection{sinz2005cardinality,
  title        = {Towards an Optimal CNF Encoding of Boolean Cardinality Constraints},
  author       = {Sinz, Carsten},
  booktitle    = {Lecture Notes in Computer Science},
  year         = {2005},
  pages        = {827-831},
  publisher    = {Springer Berlin Heidelberg},
  doi          = {10.1007/11564751\_73},
  url          = {https://doi.org/10.1007/11564751\_73},
}
@article{hogben2022book,
  title        = {Inverse Problems and Zero Forcing for Graphs},
  author       = {Hogben, Leslie and Lin, Jephian and Shader, Bryan},
  journal      = {Mathematical Surveys and Monographs},
  year         = {2022},
  publisher    = {American Mathematical Society},
  doi          = {10.1090/surv/270},
  url          = {https://doi.org/10.1090/surv/270},
}