Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 87, 2010 - Issue 4
Submit an article Journal homepage
67
Views
3
CrossRef citations to date
0
Altmetric
Section A

On the adjacent vertex distinguishing edge colourings of graphs

Bin Liu School of Mathematics and System Sciences, Shandong University, Jinan, P.R. China
&
Guizhen Liu School of Mathematics and System Sciences, Shandong University, Jinan, P.R. ChinaCorrespondence[email protected]
Pages 726-732 | Received 31 Jan 2007, Accepted 21 Jan 2008, Published online: 04 Sep 2008

References

  • Akbari , S. , Bidkhori , H. and Nosrati , N. 2006 . r-Strong edge colorings of graphs . Discrete Math. , 306 : 3005 – 3010 .
  • Balister , P. N. , Bollobás , B. and Schelp , R. H. 2002 . Vertex distinguishing colorings of graphs with Δ(G)=2, Discrete Math. . 252 : 17 – 29 .
  • Balister , P. N. , GyŐri , E. , Lehel , J. and Schelp , R. H. 2007 . Adjacent vertex distinguishing edge-colorings . SIAM J. Discrete Math. , 21 ( 1 ) : 237 – 250 .
  • Balister , P. N. , Riordan , O. M. and Schelp , R. H. 2003 . Vertex distinguishing edge colorings of graphs . J. Graph Theory , 42 : 95 – 109 .
  • Bazgan , C. , Harkat-Benhamdine , A. , Li , H. and Wozniak , M. 1999 . On the vertex-distinguishing proper edge-colorings of graphs . J. Comb. Theory Ser. B , 75 : 288 – 301 .
  • Bazgan , C. , Harkat-Benhamdine , A. , Li , H. and Wozniak , M. 2001 . A note on the vertex-distinguishing proper colorings of graphs with large minimum degree . Discrete Math. , 236 : 37 – 42 .
  • Bondy , J. A. and Murty , U. S.R. 1976 . “ Graph Theory with Applications ” . London : Macmillan .
  • Burris , A. C. and Schelp , R. H. 1997 . Vertex-distinguishing proper edge-colorings . J. Graph Theory , 26 ( 2 ) : 73 – 82 .
  • Edwards , K. , Hornak , M. and Wozniak , M. 2006 . On the neighbour-distinguishing index of a graph . Graphs Comb. , 22 : 341 – 350 .
  • Enomoto , H. , Kaneko , A. and Tuza , Zs. 1987 . P 3-factor and covering cycles in graphs of minimum degree n/3 . Colloq. Math. Soc. Janos Bolyai , 52 Combinatorics Eger Hungary
  • Ghandehari , M. and Hatami , H. Two upper bounds for the strong edge chromatic number . preprint
  • Hatami , H. 2005 . Δ+300 is a bound on the adjacent vertex distinguishing edge chromatic number . J. Comb. Theory Ser. B , 95 : 246 – 256 .
  • Liu , B. and Liu , G. Adjacent vertex distinguishing edge colorings of graphs with circumference no more than four . Utilitas Mathematica. Submitted for publication
  • Zhang , Z. , Liu , L. and Wang , J. 2002 . Adjacent strong edge coloring of graphs . Appl. Math. Lett. , 15 : 623 – 626 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

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.