A note on total colorings of 1-planar graphs |
| |
| Authors: | Július Czap |
| |
| Affiliation: | Department of Applied Mathematics and Business Informatics, Faculty of Economics, Technical University of Ko?ice, Němcovej 32, 040 01 Ko?ice, Slovakia |
| |
| Abstract: | A 1-planar graph is a graph that can be drawn in the plane such that each edge is crossed by at most one other edge. In this paper we give an upper bound for the total chromatic number for 1-planar graphs with maximum degree at least 10. |
| |
| Keywords: | Combinatorial problems 1-Planar graph Total coloring |
| 本文献已被 ScienceDirect 等数据库收录！ |
