Summary: A Jordan region is a subset of the plane that is homeomorphic to a closed disk. Consider a family \(\mathcal{F}\) of Jordan regions whose interiors are pairwise disjoint, and such that any two Jordan regions intersect in at most one point. If any point of the plane is contained in at most \(k\) elements of \(\mathcal{F}\) (with \(k\) sufficiently large), then we show that the elements of \(\mathcal{F}\) can be colored with at most \(k+1\) colors so that intersecting Jordan regions are assigned distinct colors. This is best possible and answers a question raised by B. A. Reed and F. B. Shepherd [Combinatorica 16, No. 4, 555–566 (1996; Zbl 0880.05071)]. As a simple corollary, we also obtain a positive answer to a problem of P. Hliněný [Discrete Appl. Math. 81, No. 1–3, 59–68 (1998; Zbl 0898.05025)] on the chromatic number of contact systems of strings. We also investigate the chromatic number of families of touching Jordan curves. This can be used to bound the ratio between the maximum number of vertex-disjoint directed cycles in a planar digraph, and its fractional counterpart.