On S-packing edge-colorings of graphs with small edge weight

Wei Yang and Baoyindureng Wu

Applied Mathematics and Computation, 2022, vol. 418, issue C

Abstract: The edge weight, denoted by w(e), of a graph G is max{dG(u)+dG(v):uv∈E(G)}. For an integer sequence S=(s1,s2,…,sk) with 0≤s1≤s2≤⋯≤sk, an S-packing edge-coloring of a graph G is a partition of E(G) into k subsets E1,E2,…,Ek such that for each 1≤i≤k, dL(G)(e,e′)≥si+1 for any e,e′∈Ei, where dL(G)(e,e′) denotes the distance of e and e′ in the line graph L(G) of G. Hocquard, Lajou and Lužar (Between proper and strong edge-colorings of subcubic graphs, https://arxiv.org/abs/2011.02175) posed an open problem: every subcubic bipartite graph G with w(e)≤5 is (1,24)-packing edge-colorable. We confirm the question in affirmative with a stronger way. It is shown that for any graph G (not necessarily subcubic bipartite) with w(e)≤5 is (1,24)-packing edge-colorable. We also prove that every graph G with w(e)≤6 is (1,28)-packing edge-colorable.

Keywords: Edge weight; S-Packing edge-coloring; Strong edge coloring (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321009231
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:418:y:2022:i:c:s0096300321009231

DOI: 10.1016/j.amc.2021.126840

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