Chromatic number?

[Mike Edwards]

Just wanted to check and see if there was a way to calculate a graph's
chromatic number and retrieve the color of individual nodes and/or see
nodes grouped by color? I see there's a method for bipartite graphs:

http://networkx.lanl.gov/reference/generated/networkx.bipartite_color.html

but I wondered if there's something in networkx that could work for more
colors?

-Mik

[Joel]

I would be surprised. It's been a while since I've studied anything
with chromatic numbers, but as I recall there is no general algorithm
for finding the chromatic number of a network.

Joel

On Nov 6, 3:01 pm, Mike Edwards <m...@onearmedman.com> wrote:
> Just wanted to check and see if there was a way to calculate a graph's
> chromatic number and retrieve the color of individual nodes and/or see
> nodes grouped by color?  I see there's a method for bipartite graphs:
>

> http://networkx.lanl.gov/reference/generated/networkx.bipartite_color...

[Mike Edwards]

Hmm, yeah. I was just looking at a link in a post from way back in the
networkX archives:

http://keithbriggs.info/very_nauty.html

and wondering if anything like that had been added to nx recently. The
chromatic number methods list there return the upper bound of the
number, which would be good enough for my purposes.

-Mike