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 about posting this code in case Sara's student would like to look at it? Once my own thesis is done, I'm going to spend some time cleaning it up and positing it as a ticket for review. Current code simply solves a system of equations to produce the n-coloring. However, a future implementation uses Grobner bases! Who would've thought? -- Chris --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
