共 10 条
[2]
Total coloring of embedded graphs with maximum degree at least seven
[J] .
Huijuan Wang,Bin Liu,Jianliang Wu,Guizhen Liu.  Theoretical Computer Science .
2014
[4]
On edge colorings of 1-planar graphs
[J] .
Xin Zhang,Jian-Liang Wu.  Information Processing Letters .
2010
(3)
[5]
On the total coloring of planar graphs.
[J] .
O.V. Borodin.  Journal für die reine und angewandte Mathematik (Crelles Journal) .
2009
(394)
[6]
Total colorings of planar graphs without adjacent triangles
[J] .
Xiang-Yong Sun,Jian-Liang Wu,Yu-Wen Wu,Jian-Feng Hou.  Discrete Mathematics .
2007
(1)
[7]
The total chromatic number of any multigraph with maximum degree five is at most seven
[J] .
A.V. Kostochka.  Discrete Mathematics .
1996
(1)
[8]
On the total coloring of certain graphs
[J] .
M. Rosenfeld.  Israel Journal of Mathematics .
1971
(3)
[9]
Ein Sechsfarbenproblem auf der Kugel
[J] .
Gerhard Ringel.   .
1965
(1)
[10]
Some unsolved problems in graph theory
.2
Vizing,V. G. Uspekhi Mat Nauk
. 1968