PVS‎ > ‎examples‎ > ‎

Graph coloring project

N+1 colors are enough to color a finite graph of degree N.

This is the actual theorem proved by a team of ENSEIRB-MATMECA students. The proof was completed year 2010-2011, but the project was initiated in 2008-2009, then continued in 2009-2010, before being handed to 2010-2011 students, who got the chance to complete the proof.

Proof idea
<to be completed>

Dumps, report, presentation [2010-2011]
<to be completed>

Project history from 2008-2009 to 2010-2011
<to be completed>