Odd graph and its applications to the strong edge coloring

Tao Wang and Xiaodan Zhao

Applied Mathematics and Computation, 2018, vol. 325, issue C, 246-251

Abstract: A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index χs′(G) of a graph G is the minimum number of colors in a strong edge coloring of G. Let Δ ≥ 4 be an integer. In this note, we study the odd graphs and show the existence of some special walks. By using these results and Chang’s et al. (2014) ideas, we show that every planar graph with maximum degree at most Δ and girth at least 10Δ−4 has a strong edge coloring with 2Δ−1 colors. In addition, we prove that if G is a graph with girth at least 2Δ−1 and mad(G)<2+13Δ−2, where Δ is the maximum degree and Δ ≥ 4, then χs′(G)≤2Δ−1; if G is a subcubic graph with girth at least 8 and mad(G)<2+223, then χs′(G)≤5.

Keywords: Strong edge coloring; Strong chromatic index; Odd graph; Maximum average degree; Planar graphs (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317308469
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:325:y:2018:i:c:p:246-251

DOI: 10.1016/j.amc.2017.11.057

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 ().