R. Chen, C. Cohen, J. Lévy, S. Merz, and L. Théry, Formal Proofs of Tarjan's Strongly Connected Components Algorithm in Why3, Coq and Isabelle, ITP (LIPIcs), vol.141, pp.1-13, 2019.

C. Cohen, Pragmatic Quotient Types in Coq, ITP, vol.7998, pp.213-228, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01966714

C. Cohen, A finset and finmap library, 2017.

E. Cosme, -. Llópez, and D. Pous, 2017. K 4 -free graphs as a free algebra, Schloss Dagstuhl -Leibniz-Zentrum für Informatik, vol.83, pp.1-76
URL : https://hal.archives-ouvertes.fr/in2p3-00011048

B. Courcelle and J. Engelfriet, Graph Structure and Monadic Second-Order Logic -A Language-Theoretic Approach, Encyclopedia of mathematics and its applications, vol.138, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00646514

R. Diestel, Graph Theory, 2005.

C. Doczkal, G. Combette, and D. Pous, A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs, ITP, vol.10895, pp.178-195, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01703922

C. Doczkal and D. Pous, Treewidth-two graphs as a free algebra, Schloss Dagstuhl -Leibniz-Zentrum für Informatik, vol.117, p.60, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01780844

C. Doczkal and D. Pous, Coq formalization accompanying this paper, 2019.

C. Doczkal and D. Pous, Graph Theory in Coq: Minors, Treewidth, and Isomorphisms, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02316859

R. Duffin, Topology of series-parallel networks, J. Math. Anal. Appl, vol.10, issue.65, pp.90125-90128, 1965.

J. Peter, A. Freyd, and . Scedrov, Categories, Allegories, 1990.

A. Guéneau, J. Jourdan, A. Charguéraud, and F. Pottier, Formal Proof and Analysis of an Incremental Cycle Detection Algorithm, ITP (LIPIcs), vol.141, pp.1-18, 1920.

P. Lammich and S. R. Sefidgar, Formalizing Network Flow Algorithms: A Refinement Approach in Isabelle/HOL, Journal of Algebraic Reasoning, vol.62, pp.261-280, 2019.

L. Noschinski, A Graph Library for Isabelle, Mathematics in Computer Science, vol.9, pp.23-39, 2015.

D. Pous and V. Vignudelli, Allegories: decidability and graph homomorphisms, LiCS. ACM, pp.829-838, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01703906

K. Abhishek, R. Singh, and . Natarajan, Towards a Constructive Formalization of Perfect Graph Theorems, ICLA, vol.11600, pp.183-194, 2019.

, The Mathematical Components team. 2019. Mathematical Components -Libraries of formalized mathematics