Chain decompositions of graphs, 2: Surface embeddings

Roughly speaking, a chain in a surface embedding of a graph is a continuous route in the embedding. A transection occurs when one chain crosses itself or crosses another chain. In this paper we discuss chain decompositions of graphs embedded in surfaces, with particular attention to minimizing the number of components in the decomposition, subject to the requirement that the decomposition be transection-free.