Sciweavers

8 search results - page 2 / 2
» The circular chromatic index of graphs of high girth
Sort
View
EJC
2008
13 years 5 months 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
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 5 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira