From: gordon@cs.uwa.edu.au (Gordon Royle) Newsgroups: sci.math Subject: Re: Perfect Coloring Algorithm Code? Date: 5 Apr 96 01:50:51 GMT John Keiser writes: >I need the code to some algorithm that will color any graph (it >doesn't have to be great in terms of complexity, it just has to get the >minimal coloring.) > I need to test whether my own algorithm works ... it appears to work >(it colors all the planar graphs I have run through it with four or less >colors) and seems like it should work, but I haven't the foggiest how to >prove it and want to know if it actually works for higher values so I >need to try it on large, nonplanar graphs. > I am having problems finding much on the subject of coloring graphs on >the internet ... anyone seen much? Try http://mat.gsia.cmu.edu/COLOR/color.html cheers gordon -- Gordon Royle ---- gordon@cs.uwa.edu.au Visit http://www.cs.uwa.edu.au/~gordon -- ============================================================================== From: wevrick@qucis.queensu.ca (Dan Wevrick) Newsgroups: sci.math Subject: Re: Perfect Coloring Algorithm Code? Date: 5 Apr 1996 02:17:32 GMT In article <3164554E.49B43F3@catt.ncsu.edu>, John Keiser wrote: [ .. stuff deleted ...] > I am having problems finding much on the subject of coloring graphs on >the internet ... anyone seen much? Try http://web.cs.ualberta.ca/~joe/Coloring/index.html Dan