99 search results - page 1 / 20 » Labeling planar graphs with a condition at distance two |
EJC
2007
15 years 3 days ago
2007
101
Voted
DM
2006
15 years 5 days ago
2006
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...
101
Voted
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
108
Voted
JCO
2007
15 years 1 days ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...