Neighbor sum distinguishing total coloring of sparse IC-planar graphs

被引：0

作者：

Song, Wen-yao ^{[1
]}

Miao, Lian-ying ^{[1
]}

Li, Jin-bo ^{[1
]}

Zhao, Yue-ying ^{[1
]}

Pang, Jing-ru ^{[1
]}

机构：

[1] School of Mathematics, China University of Mining and Technology, Xuzhou,221116, China

来源：

Discrete Applied Mathematics | 2019年 / 239卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Combinatorial nullstellensatz - K-coloring - K-neighbors - Maximum degree - Planar graph - Total chromatic number - Total coloring - Triangle-free

引用

页码：183 / 192

共 3 条

[1] Adjacent Vertex Distinguishing Total Coloring of Corona Product of Graphs
Furmańczyk, Hanna
Zuazua, Rita
arXiv, 2022,
[2] Adjacent vertex distinguishing total coloring of Cartesian product graphs
Course Department, Common Course Department, Anhui Xinhua University, Hefei, China
Future Mechatronics Automation Proc. Intl. Conf. Future. Mechatronics Automation, (191-194):
[3] Incidence adjacent vertex-distinguishing total coloring of graphs
Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China
不详
Proc. - Int. Conf. Comput. Intell. Softw. Eng., CiSE, 1600,