On Defected Colourings of Graphs

作     者：Bing YAO Zhong-fu ZHANG Jian-fang WANG 

作者机构：College of Mathematics and StatisticsNorthwest Normal University Institute of Applied MathematicLanzhou Jiaotong University Academy of Mathematics and Systems ScienceChinese Academy of Sciences 

出 版 物：《Acta Mathematicae Applicatae Sinica》 (应用数学学报（英文版）)

年 卷 期：2013年第29卷第4期

页      面：777-786页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China(No.61163054 and No.61163037) 

主　　题：edge coloring total coloring defected coloring 

摘      要：Abstract A k-edge-coloring f of a connected graph G is a （A1, A2, , A）-defected k-edge-coloring if there is a smallest integer/ with 1 _ /3 _〈 k - i such that the multiplicity of each color j E {1,2,... ,/3} appearing at a vertex is equal to Aj _〉 2, and each color of {/3 -}- 1,/3 - 2, - , k} appears at some vertices at most one time. The （A1, A2,, A/）-defected chromatic index of G, denoted as X （A1, A2,, A/; G）, is the smallest number such that every （A1,A2,-.., A/）-defected t-edge-coloring of G holds t _〉 X（A1, A2 A;; G）. We obtain A（G） X（A1, ）2, , A/; G） ＋ -- （Ai - 1） _〈 /k（G） 1, and introduce two new chromatic indices of G i=1 as： the vertex pan-biuniform chromatic index X pb （G）, and the neighbour vertex pan-biuniform chromatic index Xnpb（G）, and furthermore find the structure of a tree T having X pb （T） =1.