Strong edge-colorings of planar graphs with small girth

Yirong Guo, Xia Zhang and Xinmiao Zhang

Applied Mathematics and Computation, 2021, vol. 394, issue C

Abstract: A strong t-edge-coloring of a graph H is an edge coloring with t colors, in which the edges on each path of length at most 3 receive different colors. In this article, we show that: every planar graph with girth at least 8 and maximum degree D≥4 is strong (3D−2)-edge-colorable; every planar graph with girth at least 10 and maximum degree D≥5 is strong (3D−3)-edge-colorable.

Keywords: Strong edge-coloring; Planar graph; Discharging method (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320307499
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:394:y:2021:i:c:s0096300320307499

DOI: 10.1016/j.amc.2020.125796

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().