期刊论文

Li, Xiangwen

英文

Bulletin of the Malaysian Mathematical Sciences Society

0126-6705

2020

43

1

893-910

10.1007/s40840-019-00718-8

NSFCNational Natural Science Foundation of China [11571134]

本校为第一且通讯机构

A strong edge-coloring of a graph G is a proper edge-coloring such that every path of length 3 uses three different colors. The strong chromatic index of a graph G, denoted by χs′(G), is the minimum number of colors needed for a strong edge-coloring of G. In this paper, we show that χs′(G)≤3Δ-2 for any pseudo-Halin graph G with Δ ≥ 4. © 2019, Malaysian Mathematical Sciences S...