Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

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 of the graph. In this paper, we will show that 19 colors are enough to color a planar graph with maximum degree 4.

Keywords

Strong edge-coloring, Strong chromatic index, Plane graph, Discharging method

Publication Date

6-2018

Source Publication Title

Discrete Mathematics

Volume

341

Issue

6

Start Page

1629

End Page

1635

Publisher

Elsevier

Peer Reviewed

1

Copyright

© 2018 Elsevier B.V. All rights reserved.

Funder

Research was supported by NSFC grants (Nos. 11771402; 11471293) and Tianjin Research Program of Application Foundation and Advanced Technology (No.14JCYBJC43100).

DOI

10.1016/j.disc.2018.02.025

Link to Publisher's Edition

http://dx.doi.org/10.1016/j.disc.2018.02.025

ISSN (print)

0012365X

ISSN (electronic)

1872681X

Available for download on Wednesday, July 01, 2020

Included in

Mathematics Commons

Share

COinS