Bibliographic Details
| Title: |
Neighbor sum distinguishing total choosability of triangle-free IC-planar graphs. |
| Authors: |
Fugang Chao, Chao Li, Donghan Zhang |
| Superior Title: |
ScienceAsia; Aug2023, Vol. 49 Issue 4, p584-587, 4p |
| Subject Terms: |
NEIGHBORS, LOGICAL prediction, TRIANGLES, PLANAR graphs |
| Abstract: |
A proper total coloring φ of G with ∑z∈EG(u)∪{u} φ(z) ≠ ∑ z∈EG(v)∪{v} φ(z) for each uv ∈ E(G) is called a neighbor sum distinguishing (NSD) total coloring. Pil´sniak and Wo∑niak conjectured that every graph with maximum degree ∆ exists an NSD total (∆+3)-coloring. In this paper, we improve the results of Song et al [ABSTRACT FROM AUTHOR] |
|
Copyright of ScienceAsia is the property of Science Asia and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
