Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles |
| |
Authors: | Zhang Donghan |
| |
Abstract: | Czechoslovak Mathematical Journal - Let G = (V(G), E(G)) be a simple graph and EG(υ) denote the set of edges incident with a vertex υ. A neighbor sum distinguishing (NSD) total coloring... |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|