Adjacent strong edge coloring of graphs

被引：414

作者：

Zhang, ZF ^{[1
]}

Liu, LZ

Wang, JF

机构：

[1] Lanzhou Railway Inst, Inst Appl Math, Lanzhou 730070, Peoples R China

[2] Lanzhou Railway Inst, Dept Transport, Lanzhou 730070, Peoples R China

[3] Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China

来源：

APPLIED MATHEMATICS LETTERS | 2002年 / 15卷 / 05期

关键词：

graph; adjacent strong edge coloring; adjacent strong edge coloring chromatic number;

D O I：

10.1016/S0893-9659(02)80015-5

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

For a graph G(V, E), if a proper k-edge coloring f is satisfied with C(u) not equal C(v) for uv is an element of E(G), where C(u) = {f (uv) \ uv is an element of E}, then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC, and chi'(as)(G) = min{k \ k-ASEC of G} is called the adjacent strong edge chromatic number of G. In this paper, we discuss some properties of chi'(as)(G), and obtain the chi'(as)(G) of some special graphs and present a conjecture: if G are graphs a whose order of each component is at least six, then chi'(as)(G) less than or equal to Delta(G) + 2, where Delta(G) is the maximum a degree of G. (C) 2002 Elsevier Science Ltd. All rights reserved.

引用

页码：623 / 626

页数：4