The strong chromatic index of graphs with edge weight eight

Lily Chen (), Shumei Chen (), Ren Zhao () and Xiangqian Zhou ()
Additional contact information
Lily Chen: Huaqiao University
Shumei Chen: Huaqiao University
Ren Zhao: Huaqiao University
Xiangqian Zhou: Huaqiao University

Journal of Combinatorial Optimization, 2020, vol. 40, issue 1, No 13, 227-233

Abstract: Abstract The edge weight of a graph G is defined to be $$\max \{d_G(u) + d_G(v): uv \in E(G)\}$$max{dG(u)+dG(v):uv∈E(G)}. The strong chromatic index of a graph is the minimum value of k such that the edge set of G can be partitioned into k induced matchings. In this article, we prove that the strong chromatic index of a graph with edge weight eight is at most 21.

Keywords: Strong edge-coloring; Strong chromatic index; Edge weight; 05C15 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00582-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:40:y:2020:i:1:d:10.1007_s10878-020-00582-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00582-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().