Acyclic colorings of locally planar graphs

It is proved that graphs embedded in a surface with large nonseparating edge-width can be acyclically 8-colored. The condition on large nonseparating edge-width is expressed in terms of non-null-homologous circuits and is a weaker requirement than asking for large edge-width (which is based on homotopy).