Total Coloring of Planar Graphs Without Some Chordal 6-cycles

被引：8

作者：

Xu, Renyu ^{[1
]}

Wu, Jianliang ^{[1
]}

Wang, Huijuan ^{[1
]}

机构：

[1] Shandong Univ, Sch Math, Jinan 250100, Peoples R China

来源：

BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY | 2015年 / 38卷 / 02期

关键词：

Planar graph; Total coloring; Cycle; TOTAL CHROMATIC NUMBER; MAXIMUM DEGREE;

D O I：

10.1007/s40840-014-0036-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A k-total-coloring of a graph G is a coloring of vertex set and edge set using k colors such that no two adjacent or incident elements receive the same color. In this paper, we prove that if G is a planar graph with maximum Delta >= 8 and every 6-cycle of G contains at most one chord or any chordal 6-cycles are not adjacent, then G has a ( Delta + 1)-total-coloring.

引用

页码：561 / 569

页数：9

共 50 条

[1] Total Coloring of Planar Graphs Without Some Chordal 6-cycles
Renyu Xu
Jianliang Wu
Huijuan Wang
Bulletin of the Malaysian Mathematical Sciences Society, 2015, 38 : 561 - 569
[2] Total coloring of planar graphs without adjacent chordal 6-cycles
Huijuan Wang
Bin Liu
Xiaoli Wang
Guangmo Tong
Weili Wu
Hongwei Gao
Journal of Combinatorial Optimization, 2017, 34 : 257 - 265
[3] Total coloring of planar graphs without adjacent chordal 6-cycles
Wang, Huijuan
Liu, Bin
Wang, Xiaoli
Tong, Guangmo
Wu, Weili
Gao, Hongwei
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (01) : 257 - 265
[4] Total coloring of planar graphs without 6-cycles
Hou, Jianfeng
Liu, Bin
Liu, Guizhen
Wu, Jianliang
DISCRETE APPLIED MATHEMATICS, 2011, 159 (2-3) : 157 - 163
[5] Total coloring of planar graphs without 6-cycles
Center for Discrete Mathematics, Fuzhou University, Fuzhou 350002, China
不详
Discrete Appl Math, 1600, 2-3 (157-163):
[6] Total colorings of planar graphs without chordal 6-cycles
Wang, Bing
Wu, Jian-Liang
Wang, Hui-Juan
DISCRETE APPLIED MATHEMATICS, 2014, 171 : 116 - 121
[7] Vertex arboricity of planar graphs without chordal 6-cycles
Huang, Danjun
Wang, Weifan
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (02) : 258 - 272
[8] Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4-and 6-Cycles
Dong, Aijun
Wu, Jianliang
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2019, 21 (03):
[9] Total Coloring of Planar Graphs Without Chordal Short Cycles
Wang, Huijuan
Liu, Bin
Wu, Jianliang
GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1755 - 1764
[10] Total Coloring of Planar Graphs Without Chordal Short Cycles
Huijuan Wang
Bin Liu
Jianliang Wu
Graphs and Combinatorics, 2015, 31 : 1755 - 1764

← 1 2 3 4 5 →