Asymptotically optimal neighbor sum distinguishing total colorings of graphs
Authors:
- Sarah LoebSLSarah Loeb
- Jakub PrzybyłoJPJakub Przybyło
- Yunfang TangYTYunfang Tang
- 1 February 2017
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (2) , 58-62
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Centre, Poland (2014/13/B/ST1/01855)
- Polish Ministry of Science and Higher Education
- Chinese Scholarship Council
This publication has 7 references indexed in Scilit:
- Neighbor sum distinguishing total colorings of triangle free planar graphsActa Mathematica Sinica, English Series, 2015
- Asymptotically optimal neighbour sum distinguishing colourings of graphsRandom Structures & Algorithms, 2014
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degreeActa Mathematica Sinica, English Series, 2014
- Neighbor sum distinguishing total colorings of K 4-minor free graphsFrontiers of Mathematics in China, 2013
- Neighbor Sum Distinguishing IndexGraphs and Combinatorics, 2012
- A Bound on the Total Chromatic NumberCombinatorica, 1998
- How to Define an Irregular GraphThe College Mathematics Journal, 1988