On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3
Author:
- 4 January 2007
- journal article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 14 (1) , 87-109
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Vertex‐distinguishing edge colorings of graphsJournal of Graph Theory, 2002
- Adjacent strong edge coloring of graphsApplied Mathematics Letters, 2002
- Vertex distinguishing colorings of graphs with Δ(G)=2Discrete Mathematics, 2002