A graph theory problem

From: "Aldar Chan" <I_love_Nora@xxxxxxxxxxxxxxxxxx>
Date: Fri, 3 Jun 2005 21:18:15 GMT

Hi, I got the following edge labeling problem. Help is greatly
appreciated.

Given a graph G, label its edges E(G) with 1,2,3,..... so that
each vertex in V(G) has atmost k labels. Find a labeling
method which achieve the minimum number of labels. If this
problem hard?

.

Follow-Ups:
- Re: A graph theory problem
  - From: Robert Israel

Prev by Date: Re: CANTOR's theorem
Next by Date: Re: CANTOR's theorem
Previous by thread: is this hypergeometric?
Next by thread: Re: A graph theory problem
Index(es):
- Date
- Thread

Relevant Pages

Re: A graph theory problem
... I got the following edge labeling problem. ... >each vertex in Vhas atmost k labels. ... >method which achieve the minimum number of labels. ... Prev by Date: ...
(sci.math)
Re: A graph theory problem
... I got the following edge labeling problem. ... >>each vertex in Vhas atmost k labels. ... >>method which achieve the minimum number of labels. ... let Nbe the number of repetitions of the label l_i. ...
(sci.math)