|
|||||
|
|
Neighbor Sum Distinguishing Total Coloring of Triangle Free IC-planar Graphs |
|
| Authors: | Wen Yao Song Yuan Yuan Duan Lian Ying Miao |
| Affiliation: | 1. School of Mathematics and Statistics, Zaozhuang University, Zaozhuang 277160, P. R. China;2. School of Mathematics, China University of Mining and Technology, Xuzhou 221116, P. R. China |
| Abstract: | A graph is IC-planar if it admits a drawing in the plane such that each edge is crossed at most once and two crossed edges share no common end-vertex. A pr |
| Keywords: | Neighbor sum distinguishing total coloring Combinatorial Nullstellensatz triangle free IC-planar graph maximum degree |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ | |
| 点击此处可从《数学学报(英文版)》浏览原始摘要信息 | |
| 点击此处可从《数学学报(英文版)》下载免费的PDF全文 | |