顶点至多关联一个小圈的可平面图的边染色  

Edge Coloring of Planar Graphs which Each Vertex is Incident with at Most a Short-Cycle

作　　者：倪伟平 苗淇硕 NI Weiping;MIAO Qishuo(School of Mathematics and Statistics,Zaozhuang University,Zaozhuang 277160,China)

机构地区：[1]枣庄学院数学与统计学院,山东枣庄277160

出　　处：《枣庄学院学报》2025年第2期1-6,共6页Journal of Zaozhuang University

摘　　要：讨论平面图的边染色问题,并运用Discharge方法及临界图的一些重要性质证明下面的结论:最大度是6且满足下列条件之一的可平面图G是第一类图;G中每个顶点至多关联一个3-圈,或至多关联一个4-圈,或至多关联一个5-圈,或至多关联一个6-圈。The article discusses edge coloring of planar graphs and uses discharging methods and properties of critical graphs to prove that every simple planar graph G withΔ=6 is of class 1,if it satisfies one of the following conditions.Each vertex in graph G is incident with at most a 3-cycle,or at most a 4-cycle,or at most a 5-cycle,or at most a 6-cycle.

关 键 词：平面图 边染色 最大度 圈 

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