216 search results - page 12 / 44 » Exact Algorithms for L (2, 1)-Labeling of Graphs |
152
click to vote
ICALP
1995
Springer
15 years 3 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
90
Voted
WEA
2004
Springer
15 years 5 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
100
Voted
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
103
Voted
ECUMN
2004
Springer
15 years 3 months ago
2004
Springer
With the spread of portable computers, mobile users rapidly increase and have growing interests in wireless LAN (WLAN). However, when a mobile node (MN) moves, handoff can frequent...
101
Voted
AAIM
2007
Springer
15 years 5 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...