2 search results - page 1 / 1 » Properly 2-Colouring Linear Hypergraphs |
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...