Indexed by：
Abstract：
A graph is -planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
JOURNAL OF COMBINATORIAL OPTIMIZATION
ISSN： 1382-6905
Year： 2015
Issue： 1
Volume： 30
Page： 160-173
1 . 0 8
JCR@2015
0 . 9 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：86
JCR Journal Grade：2
CAS Journal Grade：3
Cited Count：
WoS CC Cited Count： 13
SCOPUS Cited Count： 16
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
