67
Views
3
CrossRef citations to date
0
Altmetric
Section A

On the adjacent vertex distinguishing edge colourings of graphs

&
Pages 726-732 | Received 31 Jan 2007, Accepted 21 Jan 2008, Published online: 04 Sep 2008
 

Abstract

A k-adjacent vertex distinguishing edge colouring or a k-avd-colouring of a graph G is a proper k-edge colouring of G such that no pair of adjacent vertices meets the same set of colours. The avd-chromatic number, denoted by χ′a(G), is the minimum number of colours needed in an avd-colouring of G. It is proved that for any connected 3-colourable Hamiltonian graph G, we have χ′a(G)≤Δ+3.

2000 AMS Subject Classification :

Acknowledgements

This work is supported by a research grant NSFC(60673047) of China. We would like to thank the referees for their various comments and suggestions, which greatly improved the present paper and particularly for providing Theorem 1.2.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.