Sciweavers

COMBINATORICA
1998
77views more  COMBINATORICA 1998»
13 years 7 months ago
A Bound on the Total Chromatic Number
We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromat...
Michael Molloy, Bruce A. Reed
COMBINATORICA
1998
51views more  COMBINATORICA 1998»
13 years 7 months ago
Principally Unimodular Skew-Symmetric Matrices
André Bouchet, William H. Cunningham, James...
COMBINATORICA
1998
90views more  COMBINATORICA 1998»
13 years 7 months ago
Approximating Probability Distributions Using Small Sample Spaces
Yossi Azar, Rajeev Motwani, Joseph Naor
COMBINATORICA
1998
94views more  COMBINATORICA 1998»
13 years 7 months ago
The Shannon Capacity of a Union
For an undirected graph G = (V, E), let Gn denote the graph whose vertex set is V n in which two distinct vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent iff ...
Noga Alon