Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

For the start of 2005, we have selected some open problems and conjectures that were posed at the Oberwolfach meeting on Graph Theory in January 2005 (click here for the conference photo). Part 2 is ...