A graph is 1-planar if it can be drawn on the plane in such a way that every edge crosses at most one other edge. We prove that the acyclic chromatic number of every 1-planar graph is at most 20.
|Original language||English (US)|
|Number of pages||13|
|Journal||Discrete Applied Mathematics|
|State||Published - Oct 30 2001|
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics