Hits :

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2018-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.341

Issue : No.6

Page Number : 1629-1635

ISSN : 0012-365X

Translation or Not : no

Key Words : Strong;edge-coloring;Strong;chromatic;index;Plane;graph;Discharging;method

Abstract : A strong edge-coloring of a graph is a proper edge-coloring such that edges at distance at most 2 receive different colors. It is known that every planar graph has a strong edge-coloring by using at most 4 Δ + 4 colors, where Δ denotes the maximum degree