The (⊿+2,2)-incidence coloring of outerplanar graphs

作     者：Shudong Wanga,b,c, Jin Xu a,b, Fangfang Mac, Chunxiang Xua,b a Institute of Software, School of Electronic Engineering and Computer Science, Peking University, Beijing 100871, China b Key Laboratory of High Con dence Software Technologies, Ministry of Education, Beijing 100871, China c College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266510, China 

作者机构：Institute of Software School of Electronic Engineering and Computer Science Peking University Beijing 100871 China Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing 100871 China College of Information Science and Engineering Shandong University of Science and Technology Qingdao 266510 China 

出 版 物：《Progress in Natural Science:Materials International》 (自然科学进展·国际材料(英文))

年 卷 期：2008年第18卷第5期

页      面：575-578页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0805[工学-材料科学与工程（可授工学、理学学位）] 0701[理学-数学] 0702[理学-物理学] 

基　　金：National Natural Science Foundation of China,NSFC: 60403001,60403002,60503002 China Postdoctoral Science Foundation: 20060400344 

主　　题：Incidence coloring Incidence chromatic number Outerplanar graph 

摘      要：An incidence coloring of graph G is a coloring of its incidences in which neighborly incidences are assigned di erent colors. In this paper, the incidence coloring of outerplanar graphs is discussed using the techniques of exchanging colors and the double inductions from the aspect of con guration property. Results show that there exists a (D + 2,2)-incidence coloring in every outerplanar graph, where D is the maximum degree of outerplanar graph.