William and Sara,
A couple nights ago, since I couldn't fall asleep, I wrote up some
Sage code that
supposedly generates an n-coloring of a graph, assuming that one
exists.
I say "supposedly" since I haven't tested it extensively. However, it
did work with
a couple of examples.
How might I go ab
William Stein wrote:
> On Wed, May 21, 2008 at 3:02 PM, Sara Billey <[EMAIL PROTECTED]> wrote:
>> Hi William, I have a undergrad working on the 4-color theorem and related
>> items for her undergrad thesis named Ruth Davidson. Part of her project is
>> to implement the computer proof by Roberts
On Wed, May 21, 2008 at 3:02 PM, Sara Billey <[EMAIL PROTECTED]> wrote:
> Hi William, I have a undergrad working on the 4-color theorem and related
> items for her undergrad thesis named Ruth Davidson. Part of her project is
> to implement the computer proof by Robertson, Sanders, Seymour and T
