| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10118374 | European Journal of Combinatorics | 2005 | 13 Pages |
Abstract
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).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Bojan Mohar,