Connectivity of Minimum Non-5-injectively Colorable Planar Cubic Graphs

作     者：Jing Jin Bao-Gang Xu 

作者机构：Institute of MathematicsSchool of Mathematical SciencesNanjing Normal UniversityNanjing 210023China College of TaizhouNanjing Normal UniversityTaizhou 225300JiangsuChina 

出 版 物：《Journal of the Operations Research Society of China》 (中国运筹学会会刊（英文）)

年 卷 期：2020年第8卷第1期

页      面：105-116页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 0701[理学-数学] 

基　　金：This research was supported by the National Natural Science Foundation of China(Nos.11571180 and 11331003) the Natural Science Foundation of Jiangsu Higher Education Institutions of China(No.17KJB110010). 

主　　题：Planar cubic graphs Connectivity 3-connected Injective coloring 

摘      要：Suppose that G is a planar cubic graph withχi(G)5.We show that ifχi(H)χi(G)for each planar cubic graph H of order less thanG,thenG is either a 3-connected simple planar cubic graph,or a planar graph obtained from a simple cubic 3-connected planar graph by adding some earrings.This shows that a minimum non-5-injectively colorable simple planar cubic graph must be 3-connected.