Re: Graph Coloring
- From: "Abid" <abidmuslim@xxxxxxxxx>
- Date: 22 Jan 2007 07:05:50 -0800
Hi Chris:
When I say pair, I mean a pair of nodes and not pair of esges. I think
claim is true for a pair of nodes. In your example <v5,v1> and <v3,v2>
are two pairs of nodes with same color.
Abid
Proginoskes wrote:
tchow@xxxxxxxxxxxxx wrote:
In article <1169252592.272319.296370@xxxxxxxxxxxxxxxxxxxxxxxxxxx>,
Proginoskes <CCHeckman@xxxxxxxxx> wrote:
Abid wrote:
1--If there are more than one pairs of nodes that donot have edges
between them , then atleast one pair will have same color.
I don't think so. The pentagon has chromatic number 3 (it requires 3
colors), and any 3-coloring (up to symmetry) looks like 12123 (going
around the cycle). If v1 and v3 are colored 1, v2 and v4 colored 2, and
v5 colored 3, then you have the two pairs (v5,v1), (v3,v2) show the
claim is false.
No, this doesn't work, because v1 and v3 have the same color.
That's not how I interpretted the problem. In my interpretation, you
choose the two non-edges first, then the coloring.
--- Christopher Heckman
.
- Follow-Ups:
- Re: Graph Coloring
- From: tchow
- Re: Graph Coloring
- References:
- Graph Coloring
- From: Abid
- Re: Graph Coloring
- From: Torben Ægidius Mogensen
- Re: Graph Coloring
- From: Abid
- Re: Graph Coloring
- From: Proginoskes
- Re: Graph Coloring
- From: tchow
- Re: Graph Coloring
- From: Proginoskes
- Graph Coloring
- Prev by Date: Re: Graph Coloring
- Next by Date: Diagonalization theorem
- Previous by thread: Re: Graph Coloring
- Next by thread: Re: Graph Coloring
- Index(es):
Relevant Pages
|