278 search results - page 9 / 56 » Two Upper Bounds on the Chromatic Number |
102
click to vote
DCC
2008
IEEE
15 years 8 months ago
2008
IEEE
We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the m...
DM
2010
15 years 1 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
126
click to vote
AAIM
2007
Springer
15 years 8 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...
128
Voted
CCCG
2010
15 years 3 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
108
Voted
GLOBECOM
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we study the diversity-multiplexing tradeoff (DMT) of two-way relay channels (TWRC) with multiantenna relay at finite signal-to-noise ratio (SNR). A two-phase decode...