Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
- 1 May 2020
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 279, 202-209
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11671232)
This publication has 18 references indexed in Scilit:
- A note on the neighbor sum distinguishing total coloring of planar graphsTheoretical Computer Science, 2016
- Neighbor sum distinguishing total choosability of planar graphs without 4-cyclesDiscrete Applied Mathematics, 2016
- On the neighbor sum distinguishing total coloring of planar graphsTheoretical Computer Science, 2016
- Neighbor sum distinguishing total colorings of planar graphs with maximum degreeDiscrete Applied Mathematics, 2015
- Neighbor sum distinguishing total colorings of triangle free planar graphsActa Mathematica Sinica, English Series, 2015
- On the Total-Neighbor-Distinguishing Index by SumsGraphs and Combinatorics, 2013
- Neighbor sum distinguishing total colorings of planar graphsJournal of Combinatorial Optimization, 2013
- On total colorings of 1-planar graphsJournal of Combinatorial Optimization, 2013
- List edge and list total coloring of 1-planar graphsFrontiers of Mathematics in China, 2012
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999