On the neighbor sum distinguishing total coloring of planar graphs
Authors:
- Cunquan QuCQCunquan Qu
- Guanghui WangGWGuanghui Wang
- Jianliang WuJWJianliang Wu
- Xiaowei YuXYXiaowei Yu
- 1 January 2016
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 609, 162-170
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (11371355, 11471193, 11271006)
- Distinguished Young Scholars of Shandong Province (JQ201501)
- Fundamental Research Funds of Shandong University
- Independent Innovation Foundation of Shandong University (IFYT14012)
This publication has 20 references indexed in Scilit:
- Neighbor sum distinguishing total colorings of planar graphs with maximum degreeDiscrete Applied Mathematics, 2015
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degreeActa Mathematica Sinica, English Series, 2014
- A note on the adjacent vertex distinguishing total chromatic number of graphsDiscrete Mathematics, 2012
- The adjacent vertex distinguishing total chromatic numberDiscrete Mathematics, 2012
- Weighted-1-antimagic graphs of prime power orderDiscrete Mathematics, 2012
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degreeSCIENTIA SINICA Mathematica, 2012
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- On the adjacent vertex distinguishing total coloring numbers of graphs withDiscrete Mathematics, 2008
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999