The total coloring of the graphs with high degree
碩士 === 國立交通大學 === 應用數學研究所 === 78 ===
Main Authors: | WANG,JUN-CHANG, 王俊昌 |
---|---|
Other Authors: | FU,HENG-LIN |
Format: | Others |
Language: | zh-TW |
Published: |
1990
|
Online Access: | http://ndltd.ncl.edu.tw/handle/13843037634726819320 |
Similar Items
-
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
by: Sun Lin, et al.
Published: (2020-11-01) -
Degree tolerant coloring of graph
by: Kok Johan
Published: (2020-12-01) -
Total colorings of graphs
by: CHEN,BO-LIANG, et al.
Published: (1991) -
A Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable
by: Enqiang Zhu, et al.
Published: (2020-01-01) -
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
by: Dong Aijun, et al.
Published: (2021-11-01)