Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
type: Item
instance of: scholarly article
title: Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
author: Xiangwen Li
author: Yangfan Li
author: Jianbo Lv
author: Tao Wang
published in: Information Processing Letters
publication date: 2022-10-28T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7609052
zbMATH Keywords: combinatorial problems
zbMATH Keywords: strong edge-coloring
zbMATH Keywords: strong chromatic index
zbMATH Keywords: sparse graphs
zbMATH Keywords: discharging method
MaRDI profile type: Publication
full work available at URL: j.ipl.2022.106313
OpenAlex ID: W4292380968
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: Colouring graphs with sparse neighbourhoods: bounds and applications
cites work: A Stronger Bound for the Strong Chromatic Index
cites work: Strong edge-colorings of sparse graphs with large maximum degree
cites work: Problems and results in combinatorial analysis and graph theory
cites work: Q3320410
cites work: Q3216671
cites work: On strong edge-colouring of subcubic graphs
cites work: Strong edge colouring of subcubic graphs
cites work: Induced matchings in cubic graphs
cites work: Strong chromatic index of graphs with maximum degree four
cites work: On strong edge-coloring of graphs with maximum degree 4
cites work: A bound on the strong chromatic index of a graph
cites work: List strong edge coloring of some classes of graphs
DOI: 10.1016/J.IPL.2022.106313
description: scientific article; zbMATH DE number 7609052