Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ<sub>2,1,2</sub>
A theta graph <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi mathvariant="sans-serif">Θ</mi><mrow><mn>2</mn><mo>,</mo><mn>1</mn><mo&g...
Main Author: | Donghan Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/7/708 |
Similar Items
-
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
by: Song Wen-Yao, et al.
Published: (2020-02-01) -
On the neighbor-distinguishing in generalized Petersen graphs
by: Shabbar Naqvi, et al.
Published: (2021-09-01) -
Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
by: Zhao Xue, et al.
Published: (2020-02-01) -
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
by: Dong Aijun, et al.
Published: (2021-11-01) -
A Note on Neighbor Expanded Sum Distinguishing Index
by: Flandrin Evelyne, et al.
Published: (2017-02-01)