Neighbor sum distinguishing total colorings of planar graphs
Authors:
- 24 September 2013
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 30 (3) , 675-688
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- 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
- Antimagic labelling of vertex weighted graphsJournal of Graph Theory, 2011
- Total weight choosability of graphsJournal of Graph Theory, 2010
- Vertex-coloring edge-weightings: Towards the 1-2-3-conjectureJournal of Combinatorial Theory, Series B, 2010
- Concise proofs for adjacent vertex-distinguishing total coloringsDiscrete Mathematics, 2009
- Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of GraphsSIAM Journal on Discrete Mathematics, 2009
- On the adjacent vertex distinguishing total coloring numbers of graphs withDiscrete Mathematics, 2008
- On adjacent-vertex-distinguishing total coloring of graphsScience China Mathematics, 2005
- Edge weights and vertex coloursJournal of Combinatorial Theory, Series B, 2004