Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with [delta] = 9, 10, or 11

It is obtained in this paper by using of discharging method that the adjacent-vertex-distinguishing proper edge chromatic number ... for any planar bipartite graph G with maximum degree ... and no component K2. This expands a result which belongs to K. Edwards, M. Hornak, M. Wozniak. (ProQuest: ......

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 115; no. 2; p. 263
Main Authors Chen, Xiang'en, Li, Zepeng
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier Sequoia S.A 01.02.2015
Subjects
Graph coloring
Graph theory
Numbers
Studies
Online AccessGet full text

Cover

More Information
Summary:It is obtained in this paper by using of discharging method that the adjacent-vertex-distinguishing proper edge chromatic number ... for any planar bipartite graph G with maximum degree ... and no component K2. This expands a result which belongs to K. Edwards, M. Hornak, M. Wozniak. (ProQuest: ... denotes formulae/symbols omitted.)
ISSN:0020-0190
1872-6119