Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Partnerships and Cooperations
XML PDF e-pub
PDF e-Pub

Section: New Results

Formal proofs of an axiomatization of graphs with tree-width two

Participants : Christian Doczkal, Damien Pous [CNRS, ENS de lyon] .

We finished the formalization of a completeness proof for an axiomatization of graphs of treewidth at most two in Coq+MathComp. This work was submitted for publication in a conference [11]. We are also revising the article presenting our proof of the Minor-Exclusion property for Treewidth-Two graphs [15] for publication in a journal. Most of the formal proofs are available from the following web-site