12 A vertex colouring of a 2-connected plane graph G is a strong parity 13 vertex colouring if for every face f and each colour c, the number of 14 vertices incident with f coloured by c is either zero or odd. 15 Czap et al. in [9] proved that every 2-connected plane graph has a 16 proper strong parity vertex colouring with at most 118 colours. 17 In this paper we improve this upper bound for s...

We present a universal view on diffusive behavior in chaotic spatially extended systems for anisotropic and isotropic media. For anisotropic systems, strong chaos leads to diffusive behavior (Brownian motion with drift) and weak chaos leads to superdiffusive behavior (Lévy processes with drift). For isotropic systems, the drift term vanishes and strong chaos again leads to Brownian motion. We e...