Strong Edge Coloring of Outerplane Graphs with Independent Crossings  

作　　者：Ke-Jie LI Xin ZHANG 

机构地区：[1]School of Mathematics and Statistics,Xidian University,Xi’an 710071,China

出　　处：《Acta Mathematicae Applicatae Sinica》2024年第2期467-477,共11页应用数学学报（英文版）

基　　金：supported by the Natural Science Basic Research Plan in Shaanxi Province of China(No.2023-JC-YB-001);the National Natural Science Foundation of China(No.11871055).

摘　　要：The strong chromatic index of a graph is the minimum number of colors needed in a proper edge coloring so that no edge is adjacent to two edges of the same color.An outerplane graph with independent crossings is a graph embedded in the plane in such a way that all vertices are on the outer face and two pairs of crossing edges share no common end vertex.It is proved that every outerplane graph with independent crossings and maximum degreeΔhas strong chromatic index at most 4Δ-6 if Δ≥4,and at most 8 ifΔ≤3.Both bounds are sharp.

关 键 词：outer-1-planar graph IC-planar graph strong edge coloring CROSSING 

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