sir, this is really very important for me . i would be really grateful
to you if you could answer this is 3-4 days.

Consider the two-staged weighted coloring for an induced subgraph G of
triangular lattice. Let
H be the subgraph induced by the nodes which stillhave non-zero
residue demands after the first
stage. Show that H has the following properties
(a) H is triangle-free.
(b) The weighted clique number of H is at at most ù − 2k, where
ù is the weighted clique
number of G.
(c) H is a forest. (Hint: Prove by contradiction that any node has at
most one right neighbor
in H.)

---

Request for Question Clarification by rbnn-ga on 02 Nov 2002 12:30 PST

Please define or provide a reference for what you mean by "two-staged
weighted coloring for an induced subgraph G of triangular lattice" .

---

Clarification of Question by lijo999-ga on 03 Nov 2002 09:33 PST

sir i really appreciate your concern in dealing with the problem as
soon as possible. i am really very thankful to you. well i do not know
why but i had posted two more problems but you experts were unable to
read. i do not know how the characters change . when i post them they
look fine . so i am giving you a link of the problem as well as the
notes for the weighted coloring. i would really appreciate it if you
could please solve the problem as soon as possible.

the link to problem is www.cs.iit.edu slash tilda wan slash hwf023.pdf
http://www.cs.iit.edu/~wan/hwf023.pdf

the link to the notes is www.cs.iit.edu slash tilda wan slash
lecture3.pdf
http://www.cs.iit.edu/~wan/lecture3.pdf

i am eagerly waiting for the answer sir.

---

Clarification of Question by lijo999-ga on 04 Nov 2002 05:32 PST

thanks a lot for the clarification sir.
 
     now coming to my problem  on the wireless networking

the link to problem is 
http://www.cs.iit.edu/~wan/hwf023.pdf 
 
the link to the notes ie weighted coloring is
http://www.cs.iit.edu/~wan/lecture3.pdf on page 17.
 
i am eagerly waiting for the answer sir.

If it helps you figure out the problem, this is what it is showing up
as (ISO-8859-1 character coding):

sir, this is really very important for me . i would be really grateful
to you if you could answer this is 3-4 days.
 
Consider the two-staged weighted coloring for an induced subgraph G of
triangular lattice. Let 
H be the subgraph induced by the nodes which stillhave non-zero 
residue demands after the first 
stage. Show that H has the following properties 
(a) H is triangle-free. 
(b) The weighted clique number of H is at at most ù − 2k, where
ù is the weighted clique 
number of G. 
(c) H is a forest. (Hint: Prove by contradiction that any node has at
most one right neighbor 
in H.)