383 search results - page 7 / 77 » A Bound on the Total Chromatic Number |
SODA
2000
ACM
13 years 9 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
TCOM
2011
13 years 2 months ago
2011
—We derive new bounds on the periodic (cyclic) total squared correlation (PTSC) of binary antipodal signature sets for any number of signatures K and any signature length L. Opti...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— We derive new bounds on the aperiodic total squared correlation (ATSC) of binary antipodal signature sets for any number of signatures K and any signature length L. We then pre...
DM
2008
13 years 7 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
CVPR
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper addresses the derivation of likelihood functions and confidence bounds for problems involving overdetermined linear systems with noise in all measurements, often referr...