Re: Coloring a graph with exact N colors
- From: TOUATI Sid <touati@xxxxxxxxxxxxx>
- Date: 27 Sep 2005 09:50:19 -0400
This is called q-coloring in graph theory (q=N in your message). The
complexity is not exponential as with optimal coloring, but the constant
of the complexity is high (=N!). In practice, N <= 12 is an observed limit.
S
.
- Follow-Ups:
- Re: Coloring a graph with exact N colors
- From: Uncle Noah
- Re: Coloring a graph with exact N colors
- References:
- Coloring a graph with exact N colors
- From: tzuchien <dot> chiu <at> gmail <dot> com
- Coloring a graph with exact N colors
- Prev by Date: Re: Parsing Expression Grammar
- Next by Date: Re: Survey of intermediate program representations?
- Previous by thread: Coloring a graph with exact N colors
- Next by thread: Re: Coloring a graph with exact N colors
- Index(es):
Relevant Pages
|
|
