Sciweavers

EJC
2008
14 years 16 days ago
On the adaptable chromatic number of graphs
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...
Pavol Hell, Xuding Zhu