Total coloring of planar graphs without chordal 7-cycles |
| |
| Authors: | Hua Cai |
| |
| Affiliation: | School of Mathematics, Shandong University, Jinan 250100, P. R. China and Department of Mathematics, Changji University, Changji 831100, P. R. China |
| |
| Abstract: | A k-total-coloring of a graph G is a coloring of vertices and edges of G using k colors such that no two adjacent or incident elements receive the same color. In this paper, it is proved that if G is a planar graph with Δ(G) ≥ 7 and without chordal 7-cycles, then G has a (Δ(G)+1)-total-coloring. |
| |
| Keywords: | Planar graph total coloring chordal 7-cycle |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
| 点击此处可从《数学学报(英文版)》浏览原始摘要信息 |
|
点击此处可从《数学学报(英文版)》下载免费的PDF全文 |
