On the adjacent vertex distinguishing total coloring numbers of graphs with
Author:
- Xiang’eN ChenXCXiang’eN Chen
- 1 September 2008
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (17) , 4003-4007
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3Journal of Combinatorial Optimization, 2007
- Adjacent Vertex Distinguishing Edge‐ColoringsSIAM Journal on Discrete Mathematics, 2007
- r-Strong edge colorings of graphsDiscrete Mathematics, 2006
- is a bound on the adjacent vertex distinguishing edge chromatic numberJournal of Combinatorial Theory, Series B, 2005
- On adjacent-vertex-distinguishing total coloring of graphsScience China Mathematics, 2005
- Adjacent strong edge coloring of graphsApplied Mathematics Letters, 2002
- On the Vertex-Distinguishing Proper Edge-Colorings of GraphsJournal of Combinatorial Theory, Series B, 1999