Neighbor sum distinguishing list total coloring of subcubic graphs
- 14 December 2017
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 35 (3) , 778-793
Abstract
No abstract availableKeywords
Funding Information
- NSFC (11571149, 11571168)
This publication has 17 references indexed in Scilit:
- Neighbor sum distinguishing total coloring of 2-degenerate graphsJournal of Combinatorial Optimization, 2016
- Every graph is (2,3)-choosableCombinatorica, 2014
- Neighbor sum distinguishing total colorings via the Combinatorial NullstellensatzScience China Mathematics, 2014
- On the Total-Neighbor-Distinguishing Index by SumsGraphs and Combinatorics, 2013
- Neighbor sum distinguishing total colorings of planar graphsJournal of Combinatorial Optimization, 2013
- Neighbor sum distinguishing total colorings of K 4-minor free graphsFrontiers of Mathematics in China, 2013
- Total weight choosability of graphsJournal of Graph Theory, 2010
- Weight choosability of graphsJournal of Graph Theory, 2008
- Combinatorial NullstellensatzCombinatorics, Probability and Computing, 1999
- The List Chromatic Index of a Bipartite MultigraphJournal of Combinatorial Theory, Series B, 1995