Graph Theory in Coq: Minors, Treewidth, and Isomorphisms - Archive ouverte HAL Access content directly
Journal Articles Journal of Automated Reasoning Year : 2020

Graph Theory in Coq: Minors, Treewidth, and Isomorphisms

Abstract

We present a library for graph theory in Coq/Ssreflect. This library covers various notions on simple graphs, directed graphs, and multigraphs. We use it to formalise several results from the literature: Menger's theorem, the excluded-minor characterization of treewidth-two graphs, and a correspondence between multigraphs of treewidth at most two and terms of certain algebras.
Fichier principal
Vignette du fichier
graphscoq.pdf (442.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02316859 , version 1 (15-10-2019)
hal-02316859 , version 2 (19-01-2020)

Identifiers

Cite

Christian Doczkal, Damien Pous. Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. Journal of Automated Reasoning, 2020, ⟨10.1007/s10817-020-09543-2⟩. ⟨hal-02316859v2⟩
214 View
554 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More