An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
Authors:
- Lianzhu ZhangLZLianzhu Zhang
- Weifan WangWWWeifan Wang
- Ko-Wei LihKLKo-Wei Lih
- 1 January 2014
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 162, 348-354
Abstract
No abstract availableAll Related Versions
Funding Information
- Institute of Mathematics, Academia Sinica
- NSFC (11171279, 10831001)
- NSC (99-2115-M-001-004-MY3)
This publication has 17 references indexed in Scilit:
- Adjacent Vertex Distinguishing Edge‐ColoringsSIAM Journal on Discrete Mathematics, 2007
- r-Strong edge colorings of graphsDiscrete Mathematics, 2006
- On the Neighbour-Distinguishing Index of a GraphGraphs and Combinatorics, 2006
- Balanced edge coloringsJournal of Combinatorial Theory, Series B, 2004
- Vertex‐distinguishing edge colorings of graphsJournal of Graph Theory, 2002
- Vertex distinguishing colorings of graphs with Δ(G)=2Discrete Mathematics, 2002
- Vertex‐distinguishing edge colorings of random graphsRandom Structures & Algorithms, 2001
- A note on the vertex-distinguishing proper coloring of graphs with large minimum degreeDiscrete Mathematics, 2001
- On the Vertex-Distinguishing Proper Edge-Colorings of GraphsJournal of Combinatorial Theory, Series B, 1999
- Vertex-distinguishing proper edge-coloringsJournal of Graph Theory, 1997