From the plane to higher surfaces
Journal of Combinatorial Theory Series B
On the Computational Complexity of Bongartz's Algorithm
Fundamenta Informaticae
Toroidal Algorithms for Mesh Geometries of Root Orbits of the Dynkin Diagram $\mathbb{D}_4$
Fundamenta Informaticae
| Hi-index | 0.00 |
It is proved that every graph embedded in a fixed surface with sufficiently large edge-width is acyclically 7-colorable and that its star chromatic number is at most $2s_0^*+3$, where $s_0^*\leq20$ is the maximum star chromatic number for the class of all planar graphs.