Indexed by:
Abstract:
The total chromatic number of a graph G, denoted by χ″(G), is the minimum number of colors needed to color the vertices and edges of G such that no two adjacent or incident elements get the same color. It is known that if a planar graph G has maximum degree Δ
Keyword:
Reprint 's Address:
Email:
Source :
Discrete Applied Mathematics
ISSN: 0166-218X
Year: 2011
Issue: 8
Volume: 159
Page: 760-768
0 . 7 9 5
JCR@2011
1 . 0 0 0
JCR@2023
JCR Journal Grade:2
CAS Journal Grade:3
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 3
Affiliated Colleges: