Sciweavers

SIAMDM
2002
52views more  SIAMDM 2002»
13 years 10 months ago
Testing k-colorability
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
Noga Alon, Michael Krivelevich
COMBINATORICA
1998
77views more  COMBINATORICA 1998»
13 years 10 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