文献类型：期刊文章

作　　者：刘林忠[1] 李引珍[2] 张忠辅[3] 王建方[4]

机构地区：[1]兰州铁道学院交通运输工程学院,甘肃兰州730070 [2]西南交通大学经济管理学院,四川成都610036 [3]兰州铁道学院应用数学研究所,甘肃兰州730070 [4]中国科学院应用数学研究所,北京100080

出　　处：《Journal of Mathematical Research and Exposition》

基　　金：Supported by NNSFC(19871036);"Qing Lan"talent funds of Lanzhou Railway Institute.

年　　份：2003

卷　　号：23

期　　号：2

起止页码：241-246

语　　种：中文

收录情况：AJ、BDHX、BDHX2000、CSCD、CSCD2011_2012、ZMATH、核心刊

摘　　要：A proper k-edge coloring f of graph G(V, E) is said to be a k:-adjacent strong edge coloring of graph G(V,E) iff every uv∈E(G) satisfy f[u]≠f/[v], where f[u] = {f(uw)|uw ∈E(G)} then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC: and x'as(G) = min{k|k-ASEC of G} is called the adjacent strong edge chromatic number. In this paper, we study the x'as(G) of Halin graphs with △A(G)≥5.

关 键 词：adjacent strong edge coloring  adjacent strong edge chromatics number  Halin graph  

分 类 号：O157.5[数学类]