24 search results - page 2 / 5 » Edge colouring by total labellings |
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
SIAMDM
2010
14 years 7 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
PCI
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leaderlabel placement, such that the total leader len...
101
click to vote
CAIP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper we integrate colour, texture, and motion into a segmentation process. The segmentation consists of two steps, which both combine the given information: a pr...
DM
2010
14 years 9 months ago
2010
An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection : V (G)E(G) [n+e], where, for every edge uv E(G), we have wt(uv) = k, the magic sum...